Scribd
Upload
17 views62 pages

Module 04 Data Structure Graph - Terminologies - Representation

Uploaded by

n3004dsouza
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
17 views62 pages

Module 04 Data Structure Graph - Terminologies - Representation

Uploaded by

n3004dsouza
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 62

Three Sample Graph

i)A path (0,1)(1,3)(3,2) is also


written as paths0,1,3,2 with
length 3

ii)0,1,3,1 of G1 is also length 3

First path is simple path,


second is not
Cycle
A Cycle is a path whose first and last nodes are the same.
✓ A cyclic graph contains at least one cycle.
✓ An acyclic graph does not contain a cycles.
Fig: A graph with two
connected components
Fig: strongly connected
components of G3
❑ Adjacency multilists
G4
Adjacency Multilists
• Each edge (u,v) is
represented by two
entries, one on the list
for u and the other on
the list for v.
• The new node
structure is

Fig: Adjacency Multilists for G1

You might also like