Directed, Undirected, weighted, Unweighted graph Representation in Adjacency list, matrix Reference Sheet

This is simple attempt to show Directed, Undirected, weighted, Unweighted graph Representation in Adjacency list, matrix. This can be helpful to understand how graph are represented or stored. The 2D adjacency matrix can be stored in 2D array and the adjacency list can be stored in linked list. A large value such as infinity may also mean there is no edge between two vertices. Graph representation in incidence matrix and list is not shown here.

For reference check out 10th chapter of DISCRETE MATHEMATICS AND ITS APPLICATIONS by Kenneth H. Rosen.


 

Graph Representation Reference Sheet:

graph representation reference sheet
graph representation reference sheet

One thought on “Directed, Undirected, weighted, Unweighted graph Representation in Adjacency list, matrix Reference Sheet

Leave a Reply

Please log in using one of these methods to post your comment:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Google photo

You are commenting using your Google account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s