6
Advanced Graphs
4 lessons in this module
0 of 4 topics completed
🔴
#25Dijkstra's Algorithm
Finds shortest paths from a source vertex to all other vertices in a weighted graph with non-negative edges.
Start Lesson
🔴
#26Bellman-Ford Algorithm
Finds shortest paths from a source vertex, can handle negative weights and detect negative cycles.
Start Lesson
🔴
#27Kruskal's Algorithm
Greedy algorithm to find Minimum Spanning Tree (MST) of a connected, weighted graph.
Start Lesson
🟡
#28Union-Find (Disjoint Set)
Efficient data structure for tracking disjoint sets, used for cycle detection and connected components.
Start Lesson