Bellman-Ford Algorithm
Find shortest paths from a source vertex to all other vertices in a weighted graph, capable of handling negative edge weights
BFS Shortest Path in Unweighted Graph (O(V+E))
Learn BFS shortest path in an unweighted graph: O(V+E) time, queue + parent[] for path reconstruction. Step-by-step for interviews—start now.
Breadth First Search (Shortest Reach)
Compute shortest distances from a start node in an undirected graph with uniform edge weight using BFS.
Floyd-Warshall Algorithm - All Pairs Shortest Path
Find shortest paths between all pairs of vertices in a weighted graph using dynamic programming
Network Delay Time (Dijkstra's Algorithm)
Find the time it takes for a signal to reach all nodes in a network using shortest path algorithms
Word Ladder
Find the shortest transformation sequence from beginWord to endWord using single character changes