4: Chinese Postman Algorithm Flashcards
(4 cards)
1
Q
What an Eulerian graph?
A
Yeah you know!
2
Q
If all vertices in a network have even degree, what is the shortest route?
A
The total weight of the network.
3
Q
If a graph has two odd vertices, what is the length of the shortest route?
A
The total weight of the network plus the length of the shortest path between the two odd vertices.
4
Q
A
