4.1 Graph representations Flashcards
1
Q
What is the space complexity of an adjacency matrix. And time complexity of an adjacency + neighbourhood query
A
1
Q
How to store a graph as an adjacency matrix
A
i, j = row, column
2
Q
How to store a graph as an adjacency list
A
3
Q
What is the space complexity of an adjacency list. And time complexity of an adjanceny + neighbourhood query
A
4
Q
Compare adjacency matrices to adjacency lists
A
5
Q
How does Google page rank use adjacency lists
A
6
Q
What are 2 examples of multi-graphs
A
Knowing we won’t cover these may help on the exam
7
Q
A
