def kruskalAlgo(self):
    i, e = 0, 0
    ds = dst.DisjointSet(self.nodes)
    self.graph = sorted(self.graph, key=lambda item: item[2])
    while e < self.V - 1:
        s, d, w = self.graph[i]
        i += 1
        x = ds.find(s)
        y = ds.find(d)
        if x != y:
            e += 1
            self.MST.append([s,d,w])
            ds.union(x,y)
    self.printSolution(s,d,w)
g = Graph(5)
g.addNode("A")
g.addNode("B")
g.addNode("C")
g.addNode("D")
g.addNode("E")
g.addEdge("A", "B", 5)
g.addEdge("A", "C", 13)
g.addEdge("A", "E", 15)
g.addEdge("B", "A", 5)
g.addEdge("B", "C", 10)
g.addEdge("B", "D", 8)
g.addEdge("C", "A", 13)
g.addEdge("C", "B", 10)
g.addEdge("C", "E", 20)
g.addEdge("C", "D", 6)
g.addEdge("D", "B", 8)
g.addEdge("D", "C", 6)
g.addEdge("E", "A", 15)
g.addEdge("E", "C", 20)
g.kruskalAlgo()
 

ZGVmIGtydXNrYWxBbGdvKHNlbGYpOgogICAgaSwgZSA9IDAsIDAKICAgIGRzID0gZHN0LkRpc2pvaW50U2V0KHNlbGYubm9kZXMpCiAgICBzZWxmLmdyYXBoID0gc29ydGVkKHNlbGYuZ3JhcGgsIGtleT1sYW1iZGEgaXRlbTogaXRlbVsyXSkKICAgIHdoaWxlIGUgPCBzZWxmLlYgLSAxOgogICAgICAgIHMsIGQsIHcgPSBzZWxmLmdyYXBoW2ldCiAgICAgICAgaSArPSAxCiAgICAgICAgeCA9IGRzLmZpbmQocykKICAgICAgICB5ID0gZHMuZmluZChkKQogICAgICAgIGlmIHggIT0geToKICAgICAgICAgICAgZSArPSAxCiAgICAgICAgICAgIHNlbGYuTVNULmFwcGVuZChbcyxkLHddKQogICAgICAgICAgICBkcy51bmlvbih4LHkpCiAgICBzZWxmLnByaW50U29sdXRpb24ocyxkLHcpCmcgPSBHcmFwaCg1KQpnLmFkZE5vZGUoIkEiKQpnLmFkZE5vZGUoIkIiKQpnLmFkZE5vZGUoIkMiKQpnLmFkZE5vZGUoIkQiKQpnLmFkZE5vZGUoIkUiKQpnLmFkZEVkZ2UoIkEiLCAiQiIsIDUpCmcuYWRkRWRnZSgiQSIsICJDIiwgMTMpCmcuYWRkRWRnZSgiQSIsICJFIiwgMTUpCmcuYWRkRWRnZSgiQiIsICJBIiwgNSkKZy5hZGRFZGdlKCJCIiwgIkMiLCAxMCkKZy5hZGRFZGdlKCJCIiwgIkQiLCA4KQpnLmFkZEVkZ2UoIkMiLCAiQSIsIDEzKQpnLmFkZEVkZ2UoIkMiLCAiQiIsIDEwKQpnLmFkZEVkZ2UoIkMiLCAiRSIsIDIwKQpnLmFkZEVkZ2UoIkMiLCAiRCIsIDYpCmcuYWRkRWRnZSgiRCIsICJCIiwgOCkKZy5hZGRFZGdlKCJEIiwgIkMiLCA2KQpnLmFkZEVkZ2UoIkUiLCAiQSIsIDE1KQpnLmFkZEVkZ2UoIkUiLCAiQyIsIDIwKQpnLmtydXNrYWxBbGdvKCkK