Graph Shortest Path

Find shortest paths in weighted and unweighted graphs using Dijkstra's algorithm, Bellman-Ford, and modified variants. Master priority-queue-driven exploration, negative edge handling, and constrained shortest path problems like "cheapest flights within K stops."