Prim'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.
Topics
Syllabus
3 chapters9 lessons1 project3 challenges55 quiz questionsIntroduction
2 lessons17- 01Introduction
- 02Motivation
The Algorithm
Project5 lessons138- 01How it works?
- 02Pseudo Code
- 03Implementation (Part 1)
- 04Implementation (Part 2)
- 05Time and Space Complexity
Final Challenges
2 lessons2- 01Final Challenge #1
- 02Final Challenge #2
More like this
Kruskal'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.
Certificate on completion
- 9
- 3
- 1
- 57
Dijkstra's Algorithm - Graph Algorithms
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.
Certificate on completion
- 9
- 3
- 1
- 54
Bellman-Ford Algorithm - Graph Algorithms
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.
Certificate on completion
- 9
- 3
- 1
- 54
Heaps & Priority Queues - Data Structures Series #7
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
Graphs - Data Structures Series #9
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
Frequently asked questions
How many lessons does Prim's Algorithm - Graph Algorithms have?
What does Prim's Algorithm - Graph Algorithms cover?
Is Prim's Algorithm - Graph Algorithms free?
