25/09Wol
aph
G V E)
: s e l o fVerlies
Sel of Cdges
NI,
(N2
E e 2,e3,e
Comple ie g1aph
n(n-1) nENY}1ts
2 foTmula
Iypes_of qroph
)unditulional qraph.
e Vrv2
e N2,Vi
direchional 4Y0ph
(N) e-V2,V1
2
el 2 V, y3
a n31N2
3
e7ee cf Venlex
V Deqee:2
V2 Na
odeqree outdegYe e
(N
Pah star a eDd Cedges)
Length af the path
Lneaa poBb
tngn Path
Conaected qaph
Suh ub Qaph
n0Tk
naph 01 0elwok.
delghhed o r
networ
a 7 a p h
ed
N e h
w3
N2
Bpaonin e e
(N2
subset
f e e rs
a
00d n-)
sponNiA4
eaites theE al
with al tonneE
h a t thty
Sutb
e dges
y e r t i e S
1101MUM
m 10imUm
haotng
haotng
ca lle
called
free 1`
of e dges ree
edges3
pannin9
he s weight
Yee
Sum of (O8d
pa0D1ng
pinimU
1aph epresentioo
)AdoaLy mo lmx
)Adia0y l1s
11) Adjany muttilist
Au0togoal 1s
Adjatenty 4clix
AC 1:1
V2 uldiTtlional
ya
NiN2 N
N1 0
V2
3
Ai ooa graph
A 2
y3 O
N4LO
T C
JndegMee: (olumn sum
outdeayee O Sum
I Prochle
ProgTam
weacprogranm to find oul i
and cutaeC de
NOLd omain (
int mio] [1o].Sumin Sumout0,VM,i
pint( Ho mony yeihtes")
Scant d n)
mii :0
Scang( d " ,4mci ) E
SumiN : 0
SumouE0
Sumin2Sumintm[il[v)
Sumoul Sumouttm[vI
pinleadeqrec -Ad" suoin)i
pualf buldeYee :Ad", Sumot
iNiE DeqTee d' sumint5 uMout
Adauen1y is
ndYCtlional z
N2)
v2
(V4) diethonot
rote
1ultil1s
) A d jaten(y
e
e3
(y3)
es
e5
3 e
4Nullese3
2 NO s
13 Nl N e
lasiNipathî |palhj_
lhogoaal 1ist
ink to v?
N 6luon lint o
head
25 XK
21
709/2o1
AOV nelwork
Athivnly of yealex nclwoik
Yenlex Coily
edge pYetedente
opolo gtrel soT
sind_oul indegee_of all ve1hices
2
02 L
The indegree of yertex
A Co
Remoue NeTtex A,ong uwith
theiy edges
(
Sind oulindeqrec af dll vtlites
Theindegyee c 0
alonq with heiTedgs
Remoue verlex
NElices
find ou indegree Of all
wiHh thelr
B auong
Vertex
)Remaue
edges
of vertex
indeg7ee
Hmaut
D U O n g( i
Yeex
eemove
o wih indege
node
Herewe
haue
in h e
y e Thies
OAl1 he
Oelete
10ph 09e deleted
(omplete.
A 0 p o l c a t c a lso?
F is
S0 1S as ollo w
topalugica| 60
O find ou i0degree o.f all NerhiLes
2 V3 VS
1 2
indegmeG of vL IS 0
emeue U1 along aith }her edges
i n d ou indegree of all VertiesS
N2 S
2 2
nde gzee o f N2 1S O
Rem0ue y2 CUong with he edges
(Sfind out indcgree of al ve}ieS
V NS
6 t1Ad O t Mdegrec
lndegee o F N3 is 0
fhei edges
Remaue Y3 olong l t h
a Nemte4
ndegzee o f
1) ind out
NS
Of Va 1S
(8 Ndegree ahtheI Ye dges
along
femoue ya
(vS Indegre
oithnd eqre
VS i t h
haue
no de
we
Here yerhites
1n h e
AIthe
V4_
Dg
erla
epteh are_deleted
C O 1 m p l e t e
1S
80r lwS
follo
opolog1L IS OS
SO
opolagita
S02
YS
V4
V
2
NI
AOE
Athiu on edgesS
Ciitalpath find
koliees ime Forw0%d PO9S)
ET nax (ETi + dii)
Lalest lime BackaoTd pass
TP minIj- dij)
U2 4
Ta L413
(v2
C74:6
t1 K
1-13
a
(vs
FTa 3 ETs 1
T3 5 LTS:1
ind (mial palh for Aboue diogzam
O kanwo1d fogs
The eaxliest ime as fallouwS
ET2 6T+di2
ET, + di3
ET3 3
o+
ET4 ET2+d2y
4+2
¬Ts + das
ETs a x E T2 d2 5 =
4 1, 3 S
max
du6ETs+ ds3
E T t
ET-may
1142 =13
may 6 4
Barktood pasg
he latest ime 0 follows
LT ETs = 13
LTs T-d5
2
LT4 l16 d 46
194
LTg LTS d 3s
UT 2 - i n(14 di LTs -d2s)
min - 2 -
LT min T2 d12, LT3 -
di
min 4- 4, 5-33
E1- ÉT2
kstra dhstest eath elgonilhm.
O)
Od Qu he shorles_poth by usl0
DkSl10 alqonithm.
So 9 h
NeTtex b
alV)_ 9
d
T
l a ) 1 101MUM
b f 0ase adjare Dt o
ALb) min 2 ) 2
aLE) min/,1)
Nealex a bC
ef h
G
dV) 2 e
b Cd
T
dA d )
aYe ad
o i n ( c o ,u ) : 4
6) 6
Min( ,
A9
h
Veiex
atb) s min
de ae ad o h
ALd) oin(4,4) 4
ale min (ce,)
ACC min Co4)2
h
Vevtex
2
e
T d
d O 1s i n m u m
e,h are a dj jo G
ALe m0 (6,1)
ytly 0 b C
a(V)
de
) 1S minimu
eisad o d
yerlex a
6
ah)3s m101mum
1Sadj oh
a g) DIN6, 1D
yeatex b
a (v)
e S
g 1 ad o e
NuteX C de
24
)15 10imuM
C d e
e1tex
Applitaion af Jqaph
00 aph
(omputer nekcoonk
ap
elecroOi iYLUL
OUOH0 0ettok
AOV
Shoe path algamEhn
Ois
