Weighted Graphs

Start at J. Walk all 7 streets. Return to J with minimal backtracking. The numbers on each edge represent the length, in hundreds of meters, of each street. What is the shortest length to start and end at vertex J?

• 35

• 44

• 43

• 26

• 46

Construct one route through each edge exactly one time with minimal back tracking. Indicate the MINIMUM time it will take to travel this route.

• 313

• 320

• 354

• 330

The distances of paths on the Atlanta Beltline are shown in the graph. What would be the minimum distance to walk all paths with minimal back tracking?

• 31

• 42

• 39

• 37

Start at E. Construct one route through each edge exactly one time with minimal back tracking to end back at E. Indicate the MINIMUM time it will take to travel this route.

• 145

• 155

• 175

• Not Possible

What is the cheapest way to go cover every path between cities with minimal backtracking? Beginning and Ending in Atlanta.

• 50

• 49

• 48

• 47