Assertion: algorithm | /r/CapableOf | find minimum spanning tree
Facets:
value: for a weighted undirected graph
type: PURPOSE
value: in a possibly disconnected graph
type: LOCATION
value: for a connected weighted graph
type: TRANSITIVE-OBJECT
Source sentences:
text: It is a greedy algorithm in graph theory as it finds a minimum spanning tree for a connected weighted graph adding increasing cost arcs at each step.
text: These algorithms find the minimum spanning forest in a possibly disconnected graph; in contrast, the most basic form of Prim's algorithm only finds minimum spanning trees in connected graphs.
text: In computer science, Prim's (also known as Jarník's) algorithm is a greedy algorithm that finds a minimum spanning tree for a weighted undirected graph.