Prim's Algorithm – Explained with a Pseudocode Example

In Computer Science, Prim’s algorithm helps you find the minimum spanning tree of a graph. It is a greedy algorithm – meaning it selects the option available at the moment. In this article, I’ll show you the pseudocode representation of Prim’s algorithm. But before that, let’s take a deeper look

from freeCodeCamp.org https://ift.tt/bUiRsyg
via IFTTT https://ift.tt/xRGN7Om