Lecture 8 Flashcards
1
Q
What is a graph? How is it mathematically described?
A
2
Q
What are undirected and directed graphs?
A
3
Q
What are sparse and dense graphs?
A
4
Q
What are the two graph representations?
A
5
Q
How does an adjacency-matrix work?
A
6
Q
How does an adjacency-list work?
A
7
Q
What is the complexity of edge-membership and a neighborhood query? And how do you get these results?
Of an adjacency-matrix and adjacency-list
A
8
Q
What are the complexities of operations of the adjacency-matrix and -list?
A
9
Q
What is a graph search algorithm?
A
10
Q
What is a Breadth-first Search algorithm? What is its key idea?
A
11
Q
What is the BFS algorithm?
A
12
Q
What is the pseudocode of the BFS algorithm?
A
13
Q
What is the runtime of BFS?
A
14
Q
What does BFS calculate?
A
