In a weighted graph, each edge will have weight (or cost) associated with it, as shown below: 6 10 Try adding weight values to each one of the edges. This is what the output should look like for the weighted directed graph: Output: -> 1 (6) 1 -> 2 (7) 2 -> 1 (4) 2-> (5) 3 -> 2 (10) 4 -> 5 (1) 5 -> 4 (3) For weighted undirected graphs, you should create a path from dest to src as well in the adjacency list