Built using Hugo and ksucs-hugo-theme.
In this chapter, we introduce minimum spanning trees (MST) as well as two algorithms to find MSTs: Kruskals Algorithm and Prims Algorithm.