1 / 64

Paths and Circuits

Paths and Circuits. Lecture 52 Section 11.2 Wed, Apr 26, 2006. The Seven Bridges of K ö nigsberg. In the city of K ö nigsberg, two branches of the Pregel River came together, with an island at their junction. The Seven Bridges of K ö nigsberg.

Download Presentation

Paths and Circuits

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Paths and Circuits Lecture 52 Section 11.2 Wed, Apr 26, 2006

  2. The Seven Bridges of Königsberg • In the city of Königsberg, two branches of the Pregel River came together, with an island at their junction.

  3. The Seven Bridges of Königsberg • There were seven bridges crossing the river at various places.

  4. The Seven Bridges of Königsberg • The challenge was to start at one point, cross each bridge exactly once, and return to the starting point. ?

  5. Euler’s Solution • Euler abstracted the bridges as a graph with four vertices and seven edges.

  6. North Shore Peninsula Island South Shore Euler’s Solution • Each vertex represents a land mass and each edge represents a bridge.

  7. Walks and Paths • A walk from vertex v to vertex w is a finite alternating sequence of adjacent vertices and edges from v to w: v0e1v1e2 … en – 1vn – 1envn, where v0 = v and vn = w. • A path from v to w is a walk that does not repeat any edge.

  8. Walks and Paths • A simple path is a path that does not repeat any vertices. • A closed walk is a walk that starts and ends at the same vertex. • A circuit is a closed path. • A simple circuit is a circuit that does not repeat any vertex.

  9. Synopsis • walk = from A to B, no restrictions. • path = walk, no repeated edge. • closed = from A to A. • circuit = closed walk. • simple = no repeated vertex.

  10. Euler Circuits • An Euler circuit is a circuit that contains every vertex and every edge of the graph. • The problem of the Seven Bridges of Königsberg is to find an Euler circuit.

  11. Connected Graphs • A graph is connected if, for every pair of vertices v and w, there is a walk from v to w. • A connected component of a graph is a maximal connected subgraph.

  12. Euler’s Solution • Theorem: A graph has an Euler circuit if and only if it is connected and every vertex has even degree. • Thus, an Euler circuit over the Seven Bridges of Königsberg does not exist.

  13. King’s Dominion I-95 RMC The Two Bridges of Ashland • At Randolph-Macon College, they have been trying to solve the Two Bridges of Ashland problem for decades. ?

  14. Proof • Proof (): • Suppose a graph G has an Euler circuit. • Let v  V(G). • Then as we travel the circuit, each time we pass through v, we “use up” two of the edges incident to v. • When we finish the circuit, we have used all the edges incident to v.

  15. Proof • Thus, v had an even number of edges. • Obviously, G must be connected.

  16. Proof • Proof (): • Now suppose that G is connected and that every vertex of G has even degree. • Choose a vertex v at which to begin. • deg(v) > 0 since G is connected, so follow one of the edges incident to v. • Let w be the next vertex. • We used one of w’s edges to get there.

  17. Proof • w has even degree, so there is at least one more edge available that we can follow. • This happens at every vertex that we visit. • Thus, the circuit is forced to terminate only when we return to the starting vertex v. • This procedure alone does not necessarily produce an Euler circuit.

  18. Proof • Suppose there are edges that were not used. • Follow the original circuit until a vertex is reached that is incident to one of the unused edges. • Apply the original procedure to produce a circuit that starts and ends at this vertex. • “Splice” it into the original circuit.

  19. Proof • Continue in this way, splicing circuits into the existing circuit, until there are no unused edges remaining. • The result is an Euler circuit.

  20. Example

  21. Example

  22. Example

  23. Example

  24. Example

  25. Example

  26. Example

  27. Example

  28. Example

  29. Example

  30. Example

  31. Example

  32. Example

  33. Example

  34. Example

  35. Example

  36. Example

  37. Example

  38. Example

  39. Example

  40. Example

  41. Example

  42. Example

  43. Example

  44. Example

  45. Example

  46. Example

  47. Example

  48. Example

  49. Example

  50. Example

More Related