10 docs tagged with "graph"

Single-source shortest paths with negative edges and reachable negative-cycle detection.

Layered graph traversal and shortest paths by edge count.

Stack-based graph traversal, parent structure, and DFS-specific guarantees.

Single-source shortest paths with nonnegative edge weights.

Dynamic programming for all-pairs shortest paths and negative-cycle detection.

A problem-first map for traversal, shortest paths, and minimum spanning trees.

Minimum spanning forests by sorted edges and disjoint-set union.

The cut property connecting Prim's and Kruskal's safe edge choices.

Growing a minimum spanning tree across the lightest eligible cut edge.

The recurrence view of shortest paths and a bridge to graph-specific algorithms.