Section 1.4 - Urban Graph Traversal
Instructions
- The first video below explains the concepts in this section.
- This page also includes exercises that you should attempt to solve yourself. You can check your answers and watch the videos explaining how to solve the exercises.
Concepts
- Weighted graphs
- Directed graphs
- Eulerizing weighted graphs at minimum cost
Exercises
Directions: You should try to solve each problem first, and then click "Reveal Answer" to check your answer. You can click "Watch Video" if you need help with a problem.
1. Eulerize the following graph at minimum cost.
Add edges CD, DI, IH, and HG.
2. Eulerize the following graph at minimum cost.
Add edges AB and BC.
3. Eulerize the following graph at minimum cost.
Add edges AC and BE.