Solution: Find the Shortest Path in a Small Town

# Create the graph
G = nx.DiGraph()
G.add_weighted_edges_from([
    ('A', 'B', 5),
    ('A', 'C', 3),
    ('B', 'D', 2),
    ('C', 'D', 4),
    ('C', 'E', 6),
    ('D', 'E', 1),
    ('D', 'F', 3),
    ('E', 'G', 5),
    ('F', 'G', 2),
    ('G', 'H', 4),
    ('G', 'I', 7),
    ('H', 'I', 2),
    ('I', 'J', 1),
])
# Find the shortest path using Dijkstra's algorithm
shortest_path = nx.dijkstra_path(G, 'A', 'J')
shortest_path_length = nx.dijkstra_path_length(G, 'A', 'J')
print(f"Shortest path: {' -> '.join(shortest_path)}")
print(f"Total distance: {shortest_path_length}")
def test(N=[]):
    return shortest_path