from __future__ import absolute_import
from __future__ import division
from __future__ import print_function

def kruskal():
	"""Kruskal's algorithm for minimum spanning tree in weighted graph.

    Time complexity for graph G(V, E): TBD.
	"""
	pass


def main():
	pass


if __name__ == '__main__':
	main()

@@ -258,16 +258,367 @@
 ain():%0A%09
+w_graph_d = %7B%0A        'a': %7B'b': 1, 'd': 4, 'e': 3%7D,%0A        'b': %7B'a': 1, 'd': 4, 'e': 2%7D,%0A        'c': %7B'e': 4, 'f': 5%7D,%0A        'd': %7B'a': 4, 'b': 4, 'e': 4%7D,%0A        'e': %7B'a': 3, 'b': 2, 'c': 4, 'd': 4, 'f': 7%7D,%0A        'f': %7B'c': 5, 'e': 7%7D%0A    %7D%0A    print('w_graph_d:%5Cn%7B%7D'.format(w_graph_d))%0A%0A    print('Kruskal%5C's minimum spanning tree:')%0A    
 pass%0A%0A%0Ai

Add weighted graph in main()