Kruskal's Algorithm - Graph Algorithms

Master Prim's Algorithm for Minimum Spanning Trees: grow one tree from a start vertex by always adding the cheapest crossing edge. Build it in your language of choice and answer bottleneck-edge and connectivity queries, the counterpart to Kruskal.

Graph Algorithms Courses

Certificate on completion

• 9
• 3
• 1
• 55

Master Dijkstra's Algorithm, the greedy single-source shortest-path method for graphs with non-negative weights. Read weighted edges, build the full distance computation in your language of choice, and answer point-to-point and farthest-vertex queries.

Graph Algorithms Courses

Certificate on completion

• 9
• 3
• 1
• 54

Master Depth-First Search, a fundamental way to explore a graph. Build the adjacency lookup, write an iterative DFS in your language of choice, analyze its O(V + E) complexity, and use it to count and measure connected components.

Graph Algorithms Courses

Certificate on completion

• 9
• 3
• 1
• 54

In this course, you will learn about the Graph data structure, create an undirected graph from zero in your preferred language, and practice coding challenges with it!

Certificate on completion

• 14
• 12

Master the Bellman-Ford algorithm: single-source shortest paths that work with negative edge weights, plus negative-cycle detection. Build a relaxation pass, the full algorithm in your language of choice, and answer distance and cycle queries.

Graph Algorithms Courses

Certificate on completion

• 9
• 3
• 1
• 54