The "Search and Shortest Path" section could also include other
functions about paths and cycles :
sage: g = digraphs.Circuit(4)
sage: g.all_
g.all_cycles_iteratorg.all_simple_cycles
g.all_paths g.all_simple_paths
g.all_paths_iterator
The only problem is that these functions are
Thanks for the feedback everyone. I have added the following new
sections: Common Invariants, Boolean Queries, NP-Related.
I will add section on common graphs, visualizatio, and frequent
iterations soon.
Best wishes,
Rafael
On Fri, Jul 29, 2011 at 3:41 AM, Nathann Cohen wrote:
> Yea !!
Yea !! Great stuff :-)
Small things you could like to add, depending on the use you intended for
your pdf :
Construction of graph through addition*multiplication :
G = 2*g + 3*h (where g and h are graphs)
or one of the most frequent loops in graph algorithms :
iterating over vertices
Very nice! Several suggestions - that are just that, suggestions.
I'd move "matrices" to be right next to "linear algebra." Maybe
include .characteristic_polynomial() in the linear algebra section.
I don't see ".diameter()" anywhere.
A section on "constructions"? You have "products", but ther
