Choose one to explore step by step

Connections, paths, and minimum costs in graphs

Ordering

Order directed graph vertices so every prerequisite appears first.

Find shortest paths from a source when edge weights are nonnegative.

Find shortest paths in a graph that can contain negative edges.

Build a minimum spanning tree by considering edges in increasing weight.

Grow a minimum spanning tree from an initial vertex.