1 / 13

Route Inspection

Route Inspection. Chinese Postman Problem. Objectives. 4.1 Determine whether a graph is traversable. 4.2 Use the route inspection ( Chinese postman algorithm to find the shortest inspection cycle in a network ). 4.1 Determine whether a graph is traversable. degree.

jon
Télécharger la présentation

Route Inspection

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. Route Inspection Chinese Postman Problem

  2. Objectives 4.1 Determine whether a graph is traversable 4.2 Use the route inspection (Chinese postman algorithm to find the shortest inspection cycle in a network).

  3. 4.1 Determine whether a graph is traversable degree Order of a vertex valency The degree or valency or order of a vertex is the number of arcs incident to it.

  4. 2.2 Basic terminology used in graph theory • If the degree of a vertex is even, we say it has even degree, so J, K and M have even degree. • Vertices (or nodes) • Vertex set • Edges (or arcs) • Edge set • Similarly vertices L and N have odd degree. • Subgraph • Degree(or valency, or order of a vertex) • Even degree • Odd degree • Path • In any graph the sum of the degrees will be precisely equal to 2 x the number of edges. This is because, in finding the sum of degrees, we are counting each end of each edge. • This is known as the Handshaking Lemma. • Walk 2 • Cycle (or circuit) 2 • connected 1 • Not connected 4 • loop 1 • Simple graph • Digraph • Directed edges

  5. 4.1 Determine whether a graph is traversable How many valencies are there for each vertex? 2 If all the valenciesin a graph are even, then the graph is Eulerian. 4 4 4 4 Is this graph traversable? 2 4 A graph is traversable if it is possible to traverse (travel along) every arc just once without taking your pen from the paper.

  6. 4.1 Determine whether a graph is traversable How many valencies are there for each vertex? 2 2 4 4 If precisely two valenciesin a graph are odd, and the rest are even, then the graph is semi-Eulerian. 1 1 2 2 Is this graph traversable? A graph is traversable if it is possible to traverse (travel along) every arc just once without taking your pen from the paper.

  7. 4.1 Determine whether a graph is traversable Which of the following graphs are traversable? 2 4 3 1 3 1 3 3 4 4 1 4 1 3 4 3 3 2 1 1 4 2 4 2 2 3 3 2 1 2 A graph is traversable if all the valencies are even. A graph is semi-traversable if it has precisely two odd valencies. A graph is not traversable if it has more than two odd valencies.

  8. 4.1 Determine whether a graph is traversable Which of the following graphs are traversable? 2 4 3 1 3 1 3 3 4 4 1 4 1 3 4 3 3 2 1 1 4 2 4 2 2 3 3 2 1 2 semi-Eulerian Eulerian All Euleriangraphsare traversable. A graph is traversable if all the valencies are even. All semi-Euleriangraphsare semi-traversable. A graph is semi-traversable if it has precisely two odd valencies. In this case the start point and the finish point will be the two vertices with odd valencies. A graph is not traversable if it has more than two odd valencies.

  9. 4.1 Determine whether a graph is traversable 1. a. Verify that the graph is Eulerian. b. Find a route, starting andfinishingat A, that traverses the graph. a. Vertex A B C D E F G Valency 2 4 4 2 4 4 4 All valencies are even, so the graph is Eulerian. b. A possible route is: A, B, C, D, E, C, G, F, E, G, B, F, A.

  10. 4.1 Determine whether a graph is traversable 2. Find a route that traverses each arc of this graph just once. You may start and finish at different points. This graph has precisely two odd valencies, so it is semi-Eulerian. 3 3 A possible route is A, B, D, C, A, B. 2 2 C D If a graph is semi-traversable, then the start point and the finish point will be the two vertices with odd valencies.

  11. 4.1 Determine whether a graph is traversable • Prove that there must always be an even (or zero) number of vertices with odd valency in every graph.

  12. 2.2 Basic terminology used in graph theory • If the degree of a vertex is even, we say it has even degree, so J, K and M have even degree. • Vertices (or nodes) • Vertex set • Edges (or arcs) • Edge set • Similarly vertices L and N have odd degree. • Subgraph • Degree(or valency, or order of a vertex) • Even degree • Odd degree • Path • In any graph the sum of the degrees will be precisely equal to 2 x the number of edges. This is because, in finding the sum of degrees, we are counting each end of each edge. • This is known as the Handshaking Lemma. • Walk 2 • Cycle (or circuit) 2 • connected 1 • Not connected 4 • loop 1 • Simple graph • Digraph • Directed edges

  13. 4.1 Determine whether a graph is traversable • Prove that there must always be an even (or zero) number of vertices with odd valency in every graph. Each arc has two ends and so will contribute two to the sum of the valencies of the whole graph. The sum of the valencies = Number of arcs × 2 The sum of the valencies is even. Any odd numbers must occur in pairs. There is an even number of odd valencies.

More Related