Follow the paths and connections in graphs, BFS, Dijkstra, and minimum spanning trees. — 8 entries
A structure that represents things as vertices and their relationships as edges.
Explores a graph one layer at a time, visiting nearby vertices first.
Follows one route as deep as possible, then backtracks to try another.
Finds minimum path costs from one source when edge weights are nonnegative.
Combines cost already paid with an estimate of cost remaining to guide path search.
Orders a directed graph so every prerequisite appears before what depends on it.
Connects every vertex without cycles while minimizing total edge weight.
Fills a connected region by spreading from a start cell to eligible neighbours.
