Classes

• Undirected Graph: Graph class
• Directed Graph: Digraph class
• Weighted Directed Graph: EdgeWeightedDigraph

Undirected Graph Algorithms

• DepthFirstSearch: Given a source vertex, to what vertices is connected
• DepthFirstPaths: Find a path from a source vertex.
• BreadthFirstPaths: Find the shortest path from a source vertex.
• Cycle: Determine if the graph has a cycle.

Digraph Algorithms

• DepthFirstOrder: Compute preorder, postorder, and reverse postorder of vertices.
• Topological: Compute a topological order of vertices in a DAG (Directed Acyclic Graph)
• DijkstraSP: Shortest Paths from a source vertex in a weighted digraph (non-negative weights)
• DirectedCycle: Does a digraph have a directed cycle?
• AcyclicSP: Shortest Paths from a source vertex in an acyclic weighted digraph (negative weights allowed, but no cycles)
• CPM: Critical Path Method - Schedule tasks given duration of each task and what tasks must finish before each task begins.