http://wibiwardhono.lecture.ub.ac
tre
(pohon)
e
http://wibiwardhono.lecture.ub.ac
G1
tre
e
G2
tre
e
G3 G4
not
tree
fore
st
http://wibiwardhono.lecture.ub.ac
Pohon Berakar
roo
t
leafs
http://wibiwardhono.lecture.ub.ac
Pohon Berakar
pare
nt
child
siblin
g
http://wibiwardhono.lecture.ub.ac
Pohon Berakar
path
http://wibiwardhono.lecture.ub.ac
Pohon Berakar
SubTREE
http://wibiwardhono.lecture.ub.ac
Pohon Berakar
d(v
)
http://wibiwardhono.lecture.ub.ac
Pohon Berakar
d(v)=0
leafs
http://wibiwardhono.lecture.ub.ac
Pohon Berakar
Internal
nodes
http://wibiwardhono.lecture.ub.ac
Pohon Berakar
LEVEL
height (depth)
=4
http://wibiwardhono.lecture.ub.ac
spanningt
ree
Sub-graf merentang berupa tree.
Diperoleh dengan cara
menghilangkan sirkuit di dalam graf
http://wibiwardhono.lecture.ub.ac
minimu
spanningt
m
ree
Metoda:
1. Algoritma Prim
2. Algoritma
Kruskal
http://wibiwardhono.lecture.ub.ac
algoritmapri
m
http://wibiwardhono.lecture.ub.ac
algoritmakru
skal
http://wibiwardhono.lecture.ub.ac
http://wibiwardhono.lecture.ub.ac