Prim's Algorithm: Difference between revisions
Jump to navigation
Jump to search
(Created page with "=Internal= * The Minimum Spanning Tree Problem") |
No edit summary |
||
| Line 1: | Line 1: | ||
=External= | |||
* https://www.coursera.org/learn/algorithms-greedy/lecture/tQ6gK/prims-mst-algorithm | |||
* https://en.wikipedia.org/wiki/Prim's_algorithm | |||
=Internal= | =Internal= | ||
* [[The Minimum Spanning Tree Problem|The Minimum Spanning Tree Problem]] | * [[The Minimum Spanning Tree Problem|The Minimum Spanning Tree Problem]] | ||
=Overview= | |||
Even the name of the algorithm is Prim, it was discovered earlier by Jarník. | |||
Revision as of 21:57, 20 October 2021
External
- https://www.coursera.org/learn/algorithms-greedy/lecture/tQ6gK/prims-mst-algorithm
- https://en.wikipedia.org/wiki/Prim's_algorithm
Internal
Overview
Even the name of the algorithm is Prim, it was discovered earlier by Jarník.