Week 3 Flashcards
1
Q
When is a walk closed?
A
2
Q
What is a tour?
A
3
Q
What is a Euler tour?
A
4
Q
When is a connected graph a Euler tour?
A
5
Q
When does a connected graph G with at least 2 vertices have an (non-closed) Euler trail?
A
6
Q
What is Fleury’s Algorithm?
A
7
Q
What is Hierholzer’s Algorithm?
A
8
Q
What is the difference between Fleury’s algorithm and Hierholzer’s algorithm?
A
