Graph Representations
A graph G = (V, E) is a set of vertices V and a set of edges E, each edge joining two vertices. Graphs model road networks, links between web pages, dependencies between tasks and much more.".
Data Structures · topic
Adjacency matrix and adjacency list with their space and operation costs, degree sum, in-degree and out-degree for directed graphs, graphical degree sequences, edge and graph counts, and how to choose a representation.
A graph G = (V, E) is a set of vertices V and a set of edges E, each edge joining two vertices. Graphs model road networks, links between web pages, dependencies between tasks and much more.".
One-page visual sheets for this topic, in the sheet library on the store. Previews are free; the full sheets come with the subject pack.