1 | initial version |

If you want to enumerate recursively the elements of a given set, you may look at:

http://doc.sagemath.org/html/en/reference/structure/sage/sets/recursively_enumerated_set.html

If the underlying graph have some structure (being graded, symmetric or a forest), then some enumeration algorithms can be more efficient (time wise or memory wise). If the graph is a forest, then enumeration and other operation like mapreduce can be done in parallel. See

http://doc.sagemath.org/html/en/reference/parallel/sage/parallel/map_reduce.html

2 | No.2 Revision |

If you want to enumerate recursively the elements of a given set, you may look ~~at:~~

http://doc.sagemath.org/html/en/reference/structure/sage/sets/recursively_enumerated_set.htmlat: sage/sets/recursively_enumerated_set.html

If the underlying graph have some structure (being graded, symmetric or a forest), then some enumeration algorithms can be more efficient (time wise or memory wise). If the graph is a forest, then enumeration and other operation like mapreduce can be done in parallel. ~~See~~See sage/parallel/map_reduce.html

http://doc.sagemath.org/html/en/reference/parallel/sage/parallel/map_reduce.html

Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.