1
Q
A
2
Q
P(w)
A
3
Q
nr(w)
A
4
Q
u(e)
A
5
Q
Depth First Search
A
6
Q
A
7
Q
In DFS, if G is connected
A
8
Q
BFS?
A
9
Q
BFS has complexity?
A
O(|E|)
10
Q
At end of BFS
A
11
Q
A
12
Q
Spanning tree
A
13
Q
Regular graph?
A
Undirected graph where each vertex has the same degree
KCL Discrete Mathematics
flashcards
Decks in class (9)
# Cards
