0% found this document useful (0 votes)
21 views13 pagesUnit 5 DSA
The document discusses various concepts related to graph theory, including directed and undirected graphs, paths, and spanning trees. It outlines algorithms for searching graphs, such as Depth-First Search and Breadth-First Search, as well as methods for finding minimum spanning trees like Kruskal's algorithm. Additionally, it touches on topological ordering and shortest path algorithms, providing a foundational understanding of graph structures and their applications.
Uploaded by
ab6688Copyright
© © 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)
21 views13 pagesUnit 5 DSA
The document discusses various concepts related to graph theory, including directed and undirected graphs, paths, and spanning trees. It outlines algorithms for searching graphs, such as Depth-First Search and Breadth-First Search, as well as methods for finding minimum spanning trees like Kruskal's algorithm. Additionally, it touches on topological ordering and shortest path algorithms, providing a foundational understanding of graph structures and their applications.
Uploaded by
ab6688Copyright
© © 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
/ 13
Ss us -
| Onr-V_
| & TTyreepucrted “Te Geaper
bby : fees
ay. quph 2 a now Leman ceile, sbtinctue# what 4%
collector 4 vertices P ee
GA és dofere ee an exclera) et CvrE),
weber x" Aepresente fie seb q verbees and 'E’
coprcceriz re edges that coppeck Hrese verboor -
Hees veg)a ga,perp and EF
ECG) -5 CAB) CB.6)/CA (D),LE/ DDE) CLE)F
Dezeced geaph
b edges dave duections -
i
\; ta ,
ee do net have. anu Aaetions
B (e>
1 ©
-@
eon facile! Yactex tw’ ix adjacent de'v! Ap
(ee OD.
Degur_g nade! po.g. os thot vertices cortato
Pepe GY =
OO) - 3
" &3 = &W
se) alata * path A path tp a rach aa nce @ verkicas =
P = 3 Vo1Vi V4. vn auch Mat Cv) ,Vi+,) Ee ;
fer léten
Abt > path = A-D-E
daraths .
Ko length 9 eh is Lhe nod a
Adee > pl Alpi
Ay
©
wf lens On c
oa path an which “Me frost anf last vedic
ac satme called egde
[A-8 -D ABD eyele »
Bau
apnedd A graph te sad be eenneddS +f
BE pot Vig alee ag
Hea an dye bly ervey pur 4 vevtraos +
one came ’ Ne of: adges arin at 2 the
np. to tHe verted.
i cabegee- : No g- edges ere
which ph Siauersa) le
Cy the meth examining She. necks Brel ex
Q che Sgaph S cabled! il Araueuing a roe ee
by Thee are 2 atheendard methods rd Basen)
a graph - medhode +
Brecadth Livt searel
Deplh Bact scavch «
ED ceed fist coach algettn: ( BRS)!
4 brs «a age caech cg ped bagers
at te fore no. and tavexe al
adyacent woke till fast mode got PEED Elge ers. 44.
Dexhih-P ;
BOF inde all connect componsiils” tn a xafh :
LD Ctrcking 1 cshovbeot path bho 2 oe 1
4 an enereiphbec| me or weighted gaph
o[ TEE Gack Asai
Ly DFS algorithm 2 expanding, the
cut) th eal node cs oe wank | a. neke
hat hes no cilden 2s encorverbesce’. -
b tohen the dae ond 3e Acaitdad, the
Lethon becek Haka, Keherring te the moet
chent node ~fhat har met been comply exp loved |
ty cin th eis es
* Mirinsrunm cost 4 spanner fee =
a ay
ak “Tepelagien Boring |e
ay 4 tepelegi cal wort iv an ecduny vertios «0
a clivectad acgele aap, aul thet af Wee % 4
path from Vi 40 XY then Vj |
