Graph algorithms

Algorithms computing properties of explicit graphs (traversal, connectivity, shortest paths, spanning trees, flows, matchings, Euler circuits) with correctness and cost proofs; pure graph theory belongs to GraphTheory, and verifiers or reductions for NP problems belong to TheoryOfComputation.

• Graph traversal and connectivity
• Shortest paths
• Spanning trees, flows and matchings

The dependency explorer needs JavaScript and its graph data.

Download the complete graph data.