2.3 The Bridges of K¨onigsberg Flashcards
1
Q
What is a graph
A
2
Q
What is a walk
A
Sequence of connected vertices
3
Q
What is a euler walk
A
A Euler walk is one which contains every edge in G exactly once.
4
Q
Why transform a problem into a graph problem
A
- Graph theorems exist (like design patterns) to solve graph problems
5
Q
When are two graphs equal
A
Set of vertices and edges are the same
6
Q
When are two graphs isomorphic
A
Can ‘rename’ each vertex
7
Q
What is the neighbourhood of a vertex
A
8
Q
What is the degree of a vertex
A
9
Q
How do euler walks relate to even amount of edges
A
