0% found this document useful (0 votes)
58 views5 pagesDSGT
Uploaded by
Shreya ChakrabortyCopyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
0% found this document useful (0 votes)
58 views5 pagesDSGT
Uploaded by
Shreya ChakrabortyCopyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
/ 5
insta:- @mustudentsunited
A big thanks to
Name: Rushikesh Nandkumar Gurav
college : Datta Meghe College of Engineering
Sem: 3 aT aaktenr
+ Wwe have studied many _clata 7
We started by Newtesves at severa) dala Structured Cho) deal
ith Itnear list
+ List. wn whith each node has a single _$! Suceessor. oo
+ Ten we looted ab s-tree stouchure, im which each ate
tould hawe multiple Successor, bul just ome predecessor.
+ Now a neo dali_stwcture_ Called G@rophs dhol ob'fters
Lyons all others: 1 [
+ Each ode may have multiple Predecessor as well at LI
multiple Suctessow.-
Graphs are very useful Shucture i
= They Can_be used “to solve Comptex —ronking ae
Problems
= Such as desigining and wong alla amene. dhe
airports Ahey Serve:
= _Similerty they can le usect le wontt rnesseges over
_a Compuliy neler from ome nede & another.
A -geeph is a ColleZhon of nodes , Callecl vertices Go
Nines Seqmenl MM. arts of ed Conmiechin: Bins
nodes (_vertices)
Tayeet of Graphs:
Two Gree of Graph: UE ee ee
__ @D Divectent @ usdivected
a_ Dicken! Graph: - Also cated as Ai
-_ 18 % qreh to tute each Vine has a bs ee
(>) iW sucessor.
= The kines in the divecheo! graph are Known as Arcs.
— in a divechect apath ,4 the Had al. Ane res __
between Wo Vobites Can fotten « ate Indécabech
Aiveebion
i
© seamed wih onen scanner Undivecleat Gah ¢
Hf = An Undirectig graph is a gap im whicl Ghee
ae Is no direetion on the hiner amen as edges -
= ln an Unchive eid) geoph dhe Herd Lchowe Bo
i Verhices Can goto either kirEebion
eage
™ “ Wi) i
(3) iS _
> A
— - Two _verbtes in a grep are Said &. i? adjacent Verhices
_ (_neifbors) if Ahere exis an edoe Aah diredlly tom
q ~ T
ty them . am a
iz 4 a ALB are adjacent |
- 7 |
Bae DLE arm.
2 ee Aegan thod t's Sequence | oh Tobees in
ution each vertex 0 ad facen|: 2 Next one. _
| GnnecheA yap) Two Verbees are said & be Conneetea}
ue if dher 6 a pithy bebircen Vhem. a
Teach
© scanned wih onen scaner rong ly Connes
eetreol ft - = |
Seat peat Steph tern toned
Path from each verGx \o every other vertig in the digraph -
Hd =
Weekly Connecheat: — when Cthere ave 2 vertices weatUnot- ane note
__ tennesteal - —
= _ disjoint _Greph —
Groph_Operahions +— J ee
_Q Aad vex inser a new - a a lun venti,
ae oddest,
=p [aad .
{tees}
©
— & a
verlix t= “Deleli verti removes a vorlir Gorn Ahe apap
aes a)
“(l= &
pees See)
® add eag - Add an yee Conreats a velx & @ detkuahen
verkine Zz
Te
1 >| =
@ Dede Edge remowes one ectoy’ » frm
2.
Tee-chers Signature
© seamed wih onen scanner ~~ Rebreseibation Of Gmph: -
-_i+ There Jette slash presewlahions of Graph bul
——temmenly used veyresentshions colle) :
te @_Ad jacency Maks x
— @_ Adlacency Ust. |_| : J
——_____ AAsaceney Makyix +
a Constdern a geoph G st n vebices and the wialn'y af M.
_—_ Sb dhere 6 an sage freseal- belwern Wilices Vid Uj
then MECICIJ=4 etee MTiI[I]+0, NeW +hal for ao undire eI
: Gee ih MOCIC=4 dhen MUiIoeJs is.ntso dt.
s 4 3s 4
a 1 B14 2 eo =
Meisti eo o ao] ae
_ ata eo o 41 a ae
wie 2 4 © «
l s oa4 ia o_ | 7
Adjammey List : a
| The Graph which o Crakid with dhe binked Uist
oAsacency Uist.
ti Celia ee |
aT I
‘
7
b
€ -
dq
