3.1 Directed Euler Walks Flashcards
1
Q
What is a directed graph
A
2
Q
What is a strongly connected directed graph
A
3
Q
What is a weakly connected directed graph
A
Means there is an undirected path between any 2 elements
4
Q
What is a strong / weak component
A
5
Q
What is the relationship between the connectedness of a directed graph and it having a euler walk
A
6
Q
What is the in and out neighbourhood of a directed graph
A
The vertices point to it and from it respectively
7
Q
What is the in and out degree of a vertex in a directed graph
A
8
Q
What are the 2 cases for a euler walk in a directed graph (in relation to in and out degrees)
A
