Graph… ADT?
Graphs are a formalism useful for representing relationships between things
- a graph G is represented as G = (V, E)
- V is a set of vertices: {v1, v2, …, vn}
- E is a set of edges: {e1, e2, …, em} where each ei connects two vertices (vi1, vi2)
- operations include:
- iterating over vertices
- iterating over edges
- iterating over vertices adjacent to a specific vertex
- asking whether an edge exists connected two vertices