A graph and graph algorithm package with support for directed and undirected graphs. There are several algorithms provided, including shortest paths, minimum spanning trees, strongly connected components, depth/breadth first search, and more. A clean API makes writing new algorithms easy.
|License||Verified by||Verified on||Notes|
|Expat||Kelly Hopkins||9 March 2010|
Leaders and contributors
Resources and communication
This entry (in part or in whole) was last reviewed on 9 March 2010.
Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.3 or any later version published by the Free Software Foundation; with no Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts. A copy of the license is included in the page “GNU Free Documentation License”.
The copyright and license notices on this page only apply to the text on this page. Any software or copyright-licenses or other similar notices described in this text has its own copyright notice and license, which can usually be found in the distribution or license text itself.