mirror of
https://github.com/dholerobin/Lecture_Notes.git
synced 2025-07-01 04:56:29 +00:00
Update Prim's Algorithm.md
This commit is contained in:
parent
e5296b40a8
commit
8ba77e289e
@ -18,29 +18,29 @@ Prim's algorithm is also a greedy algorithm, which is quite similar to Dijkstra'
|
|||||||
5. Set $V$ to $U$ and continue from step 2 until all $|V|$ vertices are in the tree.
|
5. Set $V$ to $U$ and continue from step 2 until all $|V|$ vertices are in the tree.
|
||||||
|
|
||||||
**Visualization**
|
**Visualization**
|
||||||

|

|
||||||
|
|
||||||

|

|
||||||

|

|
||||||
|
|
||||||

|

|
||||||

|

|
||||||
|
|
||||||

|

|
||||||
|
|
||||||

|

|
||||||
|
|
||||||

|

|
||||||
|
|
||||||

|

|
||||||
|
|
||||||

|

|
||||||
|
|
||||||

|

|
||||||
|
|
||||||

|

|
||||||
|
|
||||||

|

|
||||||
|
|
||||||
We will discuss two different approaches:
|
We will discuss two different approaches:
|
||||||
1. Adjacency List representation of graph
|
1. Adjacency List representation of graph
|
||||||
|
Loading…
x
Reference in New Issue
Block a user