Decision 5 - The Travelling Salesman Problem Flashcards

1
Q

What is a walk?

A

A walk in a network is a finite sequence of edges such that the end vertex of one edge is the start vertex of the next.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

What is a tour?

A

A tour is a walk which visits each vertex, returning to its starting vertex.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly