matematik.keputusan
DESCRIPTION
:)TRANSCRIPT
![Page 1: Matematik.keputusan](https://reader036.vdocuments.mx/reader036/viewer/2022082506/55cf92ed550346f57b9a7777/html5/thumbnails/1.jpg)
Graf Rangkaian Pokok• Suatu pokok adalah graf ringkas bersambung yang tidak mempunyai kitaran
atau lingkaran (cycle atau loop).
POKOK BUKAN POKOK
![Page 2: Matematik.keputusan](https://reader036.vdocuments.mx/reader036/viewer/2022082506/55cf92ed550346f57b9a7777/html5/thumbnails/2.jpg)
Trees• Connected Acyclic Graph
• Two nodes have exactly one path between them
SPECIAL TREES
PATHS
STARS
![Page 3: Matematik.keputusan](https://reader036.vdocuments.mx/reader036/viewer/2022082506/55cf92ed550346f57b9a7777/html5/thumbnails/3.jpg)
Graf Berarah - Directed Graph (Digraph)
• Edges have directions– An edge is an ordered pair of nodes
NODE
LOOP
ARC
MULTIPLE ARC
![Page 4: Matematik.keputusan](https://reader036.vdocuments.mx/reader036/viewer/2022082506/55cf92ed550346f57b9a7777/html5/thumbnails/4.jpg)
Graf Berarah (Directed graph)
• Graf di mana sekurang-kurangnya satu sisi mempunyai arah yang dikaitkan
dengannya.
![Page 5: Matematik.keputusan](https://reader036.vdocuments.mx/reader036/viewer/2022082506/55cf92ed550346f57b9a7777/html5/thumbnails/5.jpg)
Graf Sempurna - Complete Graph• Every pair of vertices are adjacent
• Has n(n-1)/2 edges
• Graf di mana setiap bucu disambung pada tiap-tiap bucu oleh satu garis tunggal.
![Page 6: Matematik.keputusan](https://reader036.vdocuments.mx/reader036/viewer/2022082506/55cf92ed550346f57b9a7777/html5/thumbnails/6.jpg)