Skip to content

Prim's algorithm is a greedy algorithm that finds a minimum spanning tree for a weighted undirected graph.

Notifications You must be signed in to change notification settings

Nabeel-etx/Prims-Algorithm

About

Prim's algorithm is a greedy algorithm that finds a minimum spanning tree for a weighted undirected graph.

Topics

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published