Prim's Algorithm - Graph Algorithms

Master Kruskal's Algorithm for Minimum Spanning Trees. Build union-find, grow an MST by adding the cheapest cycle-free edge in your language of choice, and answer connectivity and bottleneck-edge queries.

Graph Algorithms Courses

Certificate on completion

• 9
• 3
• 1
• 57

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 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

In this course, you will learn about the Heap data structure (the backbone of priority queues), create a MinHeap from zero using your preferred language, and practice coding challenges with it!

Certificate on completion

• 14
• 6
• 1

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