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.
 
 
notes/classes/algorithms/spanning_tree.md

497 B

Spanning Tree

from algorithms

a spanning tree is an undirected acyclic¹ graphs that might have weights associated with various verticies.

The goal of a minimum spanning tree traversal is to connect all of them in a way that has the shortest distance and lowest weight.

Algorithms to traverse spanning trees prims_algorithm kruskals_algorithm

¹doesn't contain cycles

see also

list without id file.inlinks
where file.name = this.file.name