quartz/content/out/notes/minimal-spending-tree.md

title
Minimal spending tree

Minimal Spending tree

Algorithm to connect up every part of the network to every other part of the network at minimal possible cost. Where the cost of connecting each pair is known.

data

hybrid version of priority queue disjoint set