1. Advanced Data Structure using C++

LECTURE NOTES OF ADVANCED DATA STRUCTURE (MT-CSE 110)
as shown in fig :f
The adjacency matrix of the directed graph in fig:F is shown in fig :G:
i \ j 1 2 3 4 5 6
1 0 1 0 0 0 0
2 0 1 1 0 0 0
3 0 0 0 0 1 1
4 0 0 1 0 0 0
5 0 0 0 0 0 0
6 0 0 0 0 0 0
Fig :G
In this representation we required nxn bits to represent a graph with n nodes .
the adjacency matrix is a simple way to represent a graph ,but it has two
disadvantages ;
1. it takes o(nxn )space to represent a graph with n vertices,even for spars
graph and
2. it takes o(nxn)time to solve most of graph problem.
ADJACENCY LIST REPRESENTATION:
In this representation ,we store a graph as a linked structure. We store all the
vertices in a list and then for each vertex ,we have a linked list of its adjacent
vertices.
Prepared By :­
Er. Harvinder Singh
Assist Prof., CSE, H.C.T.M (Kaithal) Page ‐ 79 ‐