CSCI2100 · Definition · Chapter 13 · Graph traversal
Adjacency matrix and adjacency lists
0 steps of prerequisites below it
The adjacency matrix of a directed graph is the n × n array with M[u][v] = 1 exactly for arcs u → v, while adjacency lists store each vertex’s out-neighbours, using Θ(n + m) space.
Taught in
Builds on
Nothing in the notes sits below this point: it is a starting point.
Used by
Possible roots and a review route need your own answers on these points. None are recorded yet, so none are suggested.
Longest chain down to a starting point
Nothing is recorded below this point: it is a starting point.