Shortest Path (Bellman-Ford / BFS+K) — Graph Traversal Patterns (DFS & BFS) | DSA Interview Guide