The "Search and Shortest Path" section could also include other functions about paths and cycles :
sage: g = digraphs.Circuit(4) sage: g.all_<TAB> g.all_cycles_iterator g.all_simple_cycles g.all_paths g.all_simple_paths g.all_paths_iterator The only problem is that these functions are only available for digraphs (having written them myself). I mention this because accessing paths and cycles are very classical functions and it's a good timing to ask if someone (me?) could write a patch to include such functions for non directed graphs and multigraphs as well. Anyway, thank you for your work, it's a good reference to quickly overview what is available! Alexandre -- To post to this group, send an email to sage-devel@googlegroups.com To unsubscribe from this group, send an email to sage-devel+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-devel URL: http://www.sagemath.org
