1. Advanced Data Structure using C++

LECTURE NOTES OF ADVANCED DATA STRUCTURE (MT-CSE 110)
These are :
1. Adjacent matrix
2. Adjacency list representation
3. Multi list representation
ADJACENT MATRIX:
The adjacency matrix A for a graph G=(v,e) with n vertices , is an nxn matrix of
bits such that Aij=1,if there is an edge from Vi to Vj & Aij=0,if there is no such
edge .For undirected :as shown in
fig
1 2 3 4 5 6
I \ j
1 0 1 0 0 0 0
2 1 1 1 0 0 0
3 0 1 0 1 1 1
4 0 0 1 0 0 0
5 0 0 1 0 0 0
6 0 0 1 0 0 0
Fig:e
The adjacency matrix for the undirected graph is shown in fig E.
For directed graph: An edge of a directed graph has its source in one node and
terminates in another nodes .By convection (Vi,Vj) denotes direction for node Vi
to nodeVj.
Prepared By :­
Er. Harvinder Singh
Assist Prof., CSE, H.C.T.M (Kaithal) Page ‐ 78 ‐