Algorithms for minimum spanning trees and shortest paths. Implementations of: Prim, Kruskal, Dijkstra, Bellman-Ford, Floyd-Warshall, Dantzig, A*.