directed_graph 0.3.1

Directed (weighted) graphs with algorithms enabling topological ordering and sorting of vertices. The package provides a graph crawler for finding the paths connecting two vertices.

example/README.md

Directed Graph - Example

The files located in the folder bin contain short programs that demonstrate how to:

• create a numerical representation of the directed graph shown in the figure below using the class DirectedGraph ,
• create an object of type WeightedDirectedGraph and find the shortest, lightest, and heaviest path between two vertices,
• use the class GraphCrawler.

Features and bugs

Please file feature requests and bugs at the issue tracker.