Fig. 5From: Governance and sustainability of distributed continuum systems: a big data approachMaximum spanning tree construction using Kruskal’s algorithms (a) Initial Tree with empty edges (b) Considering first maximum MI weight which is \((\overline{TH,PL})\) (c) Considering second maximum MI weight which is \((\overline{PL,BU})\) (d) Considering next maximum MI weight which is \((\overline{BU,DE}\))Back to article page