Graph algorithms Algorithms that handle networks of nodes. They are called "complete" if all nodes are connected to all other nodes. [[Dijkstra's Algorithm]]