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.

498 B

Kruskals Algorithm

Kruskals algorithm is another method for traversing a spanning_tree, which operates by looking at the weights of the edges, and only using them if they are not attached to any currently discovered verticies.

on smaller graphs, this can look similar to prims_algorithm after a while, but can involve creating several unconnected trees that are connected together to create a tree.

see also

list without id file.inlinks
where =