kartikkukreja · August 29, 2015 14:04
diff --git a/Prim's MST Algorithm.py b/Prim's MST Algorithm.py
 Let the MST contain a single vertex v, where v is any arbitrary vertex of the graph
 while it is possible to add an edge (u, v) to the MST such that u ∈ MST and v ∉ MST
  add v and the least-cost edge (u, v) to the MST such that u ∈ MST and v ∉ MST
 return MST
	Let the MST contain a single vertex v, where v is any arbitrary vertex of the graph
	while it is possible to add an edge (u, v) to the MST such that u ∈ MST and v ∉ MST
	add v and the least-cost edge (u, v) to the MST such that u ∈ MST and v ∉ MST
	return MST