1. Advanced Data Structure using C++

LECTURE NOTES OF ADVANCED DATA STRUCTURE (MT-CSE 110)
In undirected method we have numbered a node as 1,2,3,4,5. therefore:
V(G)={1,2,3,4,5}&
E(G)={(1,2),(2,4),(2,3),(1,4),(1,5),(4,5),(3,4)}
This is to be notice that edge incident with node 1& 2 is written as (1,2) ;we
could also written it as (2,1).And this may same for all other edges .
2. Directed:In an directed graph , pair of vertices representing any edges is
ordered .if e=(v,w) ,then v is initial vertex and w is the final vertex
subsequently (v,w )&(w,v). Represents two different edges .
a directed graph may be
pictorially represented as in fig C(above).
GRAPH REPRESENTATION:
Graph is a mathematical structure and finds its applications in many areas of
interest in which problem need to be solved using computers .thus ,this
mathematical structures must be represent in some kind of data structure
.there are three such representations which are commonly used.
Prepared By :­
Er. Harvinder Singh
Assist Prof., CSE, H.C.T.M (Kaithal) Page ‐ 77 ‐