1. Advanced Data Structure using C++

LECTURE NOTES OF ADVANCED DATA STRUCTURE (MT-CSE 110)
Multi‐list representation:
In the multi‐list representation of graph structures, there are two parts ,a
directory of nodes information and a set of linked list of edge information .there
is one entry in the node directory for each node of the graph .the directory
entry for node i points to a linked adjacency list for node i. each record of the
linked list area appears on two adjacency list:one for the node at each end of
the represented edge.
Using the data structure of fig :j for each edge entry (Vi,Vj),a multi‐list
representation for the eg. Graph of fig :u is fig:K
Prepared By :­
Er. Harvinder Singh
Assist Prof., CSE, H.C.T.M (Kaithal) Page ‐ 81 ‐