D1 Route inspection 04/10/11

• Reminder of traversable (Eulerian) and semi-traversable (semi-Eulerian) graphs
• The route inspection problem
• Examples of using the route inspection problem

https://docs.google.com/viewer?a=v&pid=explorer&chrome=true&srcid=0B2J1T-insOmpMzhlZmYxMGEtZWUxNS00N2U0LThhMjItMjBjZjc3OTNmMDNm&hl=en_US