Prim's algorithm builds a tree of minimum weight by iteratively adding the lightest edges from an initial vertex. Finds the shortest path in a graph
Primary LanguagePython