Graphs Introduction to Graph Algorithms . There are several ways to represent graphs. The most commonly used ones are Adjacency Matrix and Adjacency list.
Incidence matrix is one more way to store a graph.
Let s consider an example. The adjacency list representation stores a graph as a collection of linked lists. Each list starts at some node of the graph and contains all the nodes adjacent to this node. The adjacency list for the example follows. The Adjacency matrix stores a graph in a square table with rows and columns corresponding to the nodes in the graph.