dsap.graph

package documentation

Code from the chapter "Graph Algorithms".

Module	`bfs`	Provides BFS and BFS_complete function to support breadth-first search of a graph.
Module	`dfs`	Provides DFS, DFS_complete, and construct_path functions for depth-first search of a graph.
Module	`graph`	Provides Graph class and nested Vertex and Edge classes for representing a graph structure.
Module	`graph_examples`	Provides graph instances used in the book's examples.
Module	`mst`	Provides MST_PrimJarnik and MST_Kruskal functions for computing the minimum spanning tree of a graph.
Module	`partition`	Provides the Partition class maintaining a disjoint partition of a universe of elements.
Module	`shortest_paths`	Provides shortest_path_distances and shortest_path_tree functions for computing shortest paths in a weighted graph.
Module	`topological_sort`	Provides topological_sort function that computes a topological order for a directed acyclic graph
Module	`transitive_closure`	Provides floyd_warshall function for computing the transitive closure of a graph.