2021-05-24

import numpy as np
import networkx as nx
List=[(0,1,1),(0,2,2),(0,4,7),(0,6,4),(0,7,8),(1,2,2),(1,3,3),(1,7,7),(2,3,1),(2,4,5),(3,4,3),(3,5,6),(4,5,4),(4,6,3),(5,6,6),(5,7,4),(6,7,2)]
G.nx.Graph()
G.add_weighted_edges_from(list)
A=nx.to_numpy_matrix(G, nodelist=range(8))
np.savetxt(‘Pdata10_6.txt’,A)
p=nx.dijkstra_path(G, source=3, target=7,weight=‘weight’)
d=nx.dijkstra_path_length(G, 3, 7, weight=‘weight’)
print(“smallest route is:,“p”; smallest distance is:”,d)