mirror of
https://github.com/dholerobin/Lecture_Notes.git
synced 2025-09-13 05:42:12 +00:00
Update Prim's Algorithm.md
This commit is contained in:
@@ -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.
|
||||
|
||||
**Visualization**
|
||||

|
||||

|
||||
|
||||

|
||||

|
||||

|
||||

|
||||
|
||||

|
||||

|
||||

|
||||

|
||||
|
||||

|
||||

|
||||
|
||||

|
||||

|
||||
|
||||

|
||||

|
||||
|
||||

|
||||

|
||||
|
||||

|
||||

|
||||
|
||||

|
||||

|
||||
|
||||

|
||||

|
||||
|
||||

|
||||

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