1. Advanced Data Structure using C++

LECTURE NOTES OF ADVANCED DATA STRUCTURE (MT-CSE 110)
For undirected: below shown fig:h is aadjacency list representation of
undirected graph in fig D.
An undirected graph of order N with E edges requires N enteries in the directory
and ZxE linked list enteries,except that each loop reduces the no.of linked list
enteries by one.
For directed :adjacency list representatioof the directed graph of fig :F is shown
in fig:I
A directed graph of order an with E edges requires N enteries in the directory
and E linked list enteries .
Prepared By :­
Er. Harvinder Singh
Assist Prof., CSE, H.C.T.M (Kaithal) Page ‐ 80 ‐