Data Structures and Algorithms · Graphs

Graph representations

Storing a graph's vertices and edges as an adjacency matrix or adjacency list.

Also known as: adjacency list, adjacency matrix, directed graph, undirected graph.

Start a lesson on Graph representations

Learn first

• Arrays: A fixed-layout, contiguous block of memory where any index is reached in constant time.

Leads to

• Graph traversal (BFS and DFS): Visiting every reachable vertex, either level by level (BFS) or by diving deep first (DFS).
• Union-find: A structure that tracks which elements belong to the same group and merges groups quickly.

Related topics

• Graph traversal (BFS and DFS): Visiting every reachable vertex, either level by level (BFS) or by diving deep first (DFS).