how to find shortest path in a weighted graph using networkx?,"nx.dijkstra_path(g, 'b', 'b', 'distance')"