Chinese Postman Problem Presentation Pdf Routing Applied Mathematics Ib math video about press copyright contact us creators advertise developers terms privacy policy & safety how works test new features nfl sunday ticket © 2025 google llc. If there are 4 odd vertices you may be asked to start and finish at different vertices. find the length of the routes for all possible pairings of the odd vertices and choose the shortest route between any 2 of them to be repeated. the other two odd vertices will be your start and finish points.
Presentation Chinese Postman Problem Pdf What variations may there be on the chinese postman algorithm? the weighting of the edge between a pair of vertices may be different depending on if it is the first time it is being traversed or a repeat. if there are 4 odd vertices you may be asked to start and finish at different vertices. Good candidates started with the number of vertices of odd degree. weaker candidates just tried to write the answer down without complete reasoning. all the 3 ways of joining the odd vertices had to be considered so that you knew you had the smallest. Show that a graph cannot have exactly one vertex of odd degree. b. (i) a1a1a1. note: award a1 for the vertices, a1 for edges and a1 for planar form. (ii) it is possible to find an eulerian trail in this graph since exactly two of the vertices have odd degree r1. (iii) b and d are the odd vertices m1. Step 1: we can see that the only odd vertices are a and h. step 2: we can only pair these one way (ah) step 3 and 4: the shortest way to get from a to h is abfh which is length 160.
Hamiltonian Graphs Chinese Postman Problem Travelling Salesman Problem Pdf Show that a graph cannot have exactly one vertex of odd degree. b. (i) a1a1a1. note: award a1 for the vertices, a1 for edges and a1 for planar form. (ii) it is possible to find an eulerian trail in this graph since exactly two of the vertices have odd degree r1. (iii) b and d are the odd vertices m1. Step 1: we can see that the only odd vertices are a and h. step 2: we can only pair these one way (ah) step 3 and 4: the shortest way to get from a to h is abfh which is length 160. Practice with hundreds of real exam style questions from the ib mathematics applications & interpretation (math ai) questionbank. Access 221 video tutorials for ib mathematics ai sl hl nailib ib resources ib math ai sl nailib ib resources ib math ai hl. If there are two odd vertices there is only one way of pairing them together. if there are four odd vertices there are three ways of pairing them together. how many ways are there of pairing six or more odd vertices together? if there are six odd vertices abcdef, then consider the vertex a. List all possible pairings of odd vertices. for each pairing find the edges that connect the vertices with the minimum weight. find the pairings such that the sum of the weights is minimised.
Comments are closed.