1. Weighted Graphs
AQR

2. Definition
Weighted graphs are those whose edges have weight or value.

3. 1. Design a path for each route returning to the place where you started and calculate the time it will take to traverse it. The time is in minutes. 2. The Rancor route has two vertices with odd degrees. Use the follow instructions to find the shortest route through this route. a. Find the shortest path between the 2 odd vertices. b. For each edge in the shortest path, put a second copy of each edge. c. With these modifications done to the map now there are no odd vertices. The missing sides are: BE = 12 & CF = 11

4. Kessler’s Run
Missing side BC = 3