Explore algorithms for traversing and finding optimal paths in graphs and trees.
Single-source shortest path algorithm that handles negative edge weights.
Computes the maximum flow in a flow network.
Finds the shortest path between nodes in a graph with non-negative weights.
Traverses a graph level by level, useful for finding shortest paths in unweighted graphs.
Explores as far as possible along each branch before backtracking.