A depth-first search traversal of a graph.

A breadth-first search traversal of a graph.

Computing the minimum spanning tree of a graph.

Computing the all-pairs shortest path in a graph.

O(n)

O(n log n)

O(n²)

O(n³)

Flow maximization algorithm

Shortest path algorithm

Minimum spanning tree algorithm

Topological sort

O(log₂ n)

O(n)

O(n log₂ n)

0(n²)

O(log₂ n)

O(n)

O(1)

O(n²)