Prim's algorithm is a greedy algorithm used to find the Minimum Spanning Tree (MST) of a weighted, undirected graph. A Minimum Spanning Tree is a subset of edges that connects all vertices in the graph without any cycles and with the minimum possible total edge weight. ### How Prim's Algorithm Works: 1. **Initialization**: Start with an arbitrary vertex and mark it as part of the MST.

Ancestors (6)

  1. Graph algorithms
  2. Algorithms
  3. Applied mathematics
  4. Fields of mathematics
  5. Mathematics
  6. Home

View article source

Discussion (0)

New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.
See all articles in the same topic Create my own version