Analysis of algorithms for finding the shortest path in graphs. Includes Dijkstra, Bellman-Ford, and Floyd-Warshall algorithms commonly used for weighted and unweighted graphs