Contents
Index
Implements Kruskal’s algorithm for finding minimum or maximum spanning tree.
graph – input graph
maximise – if True, find maximum spanning tree (default: False)
True
False
spanning tree