1. Advanced Data Structure using C++

LECTURE NOTES OF ADVANCED DATA STRUCTURE (MT-CSE 110)
this is not the only multi‐list representation for this graph. It is based on the set
of edges {(1,2),(2,2),(2,3),(4,3),(3,5),(3,6)}.an alternative representation based
upon the set edges .{(2,1),(2,2),(2,3),(3,4),(5,3),(3,6)} is shown in fig:k. if the
graph were directed ,there would not be such flexibility in selecting identifiers
for edges an edge wieght can be stored with the other information recorded for
the edge ,just as was done in earlier example of graph representations .
Traversal Algorithms
Prepared By :­
Er. Harvinder Singh
Assist Prof., CSE, H.C.T.M (Kaithal) Page ‐ 82 ‐