You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

431 B

Prims Algorithm

from algorithms

A method of solving a spanning_tree by starting at an arbitrary vertex on a graphs and taking the lowest value from there.

As with spanning tree solutions to graphs, this must be acyclic, so no elements can be hit twice otherwise you would get stuck in a loop.

see also

list without id file.inlinks
where =