import networkx as nx import matplotlib.pyplot as plt # Create an empty graph G = nx.Graph() # Add edges to the graph G.add_edge(1, 2, weight=3) G.add_edge(1, 3, weight=4) G.add_edge(2, 3, weight=5) G.add_edge(2, 4, weight=2) G.add_edge(3, 4, weight=1) pos = nx.spring_layout(G) nx.draw(G, pos, with_labels=True) nx.draw_networkx_edge_labels(G, pos, edge_labels={(u, v): G[u][v]['weight'] for u, v in G.edges()}) # Show the plot # Apply Kruskal's algorithm to find the minimum spanning tree mst = nx.minimum_spanning_tree(G) # Draw the graph pos = nx.spring_layout(mst) nx.draw(mst, pos, with_labels=True) nx.draw_networkx_edge_labels(mst, pos, edge_labels={(u, v): mst[u][v]['weight'] for u, v in mst.edges()}) # Show the plot f=0 for u,v in mst.edges(): f+=mst[u][v]['weight'] print(u,"-",v,":",mst[u][v]['weight']) print(f)