The edges of the network have different weights. Find the efficient route from A to B.
Step 1 Find all of the possible paths from A to B . Label each path with the letters of the nodes along the path.
Step 2 Trace each path and add the weights of each edge. The path with the least weight is the efficient route: A-U-X-Y-Z-B . The weight is 54 .
What is the longest path from A to B that does not cover any edges more than once?