Consider the weighted graph shown in Figure. List all of the possible paths from vertex 2 to vertex 3, along with the total weight of each path.
Figure
Breadth-first traversal for an unconnected undirected graph

We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.