Struktur Data Graph.

Presentasi berjudul: "Struktur Data Graph."— Transcript presentasi:

1 Struktur Data Graph

2 Definisi Tersusun atas:
Edge Vertex Sebuah graph disebut connected jika setiap vertex memiliki degree minimal 1 ©2013 – Erick Pranata

3 Struktur Data untuk Graph
Edge List Adjancency List Adjancency Matrix ©2013 – Erick Pranata

4 Representasikan Graph Berikut Ini!
©2013 – Erick Pranata

5 Edge List Menyimpan edges dan vertices dalam list yang tidak diurutkan. Edges juga dilengkapi dengan link ke vertices terkait. ©2013 – Erick Pranata

6 Edge List ©2013 – Erick Pranata

7 Adjacency List (Tradisional)
Kumpulan vertices yang saling adjacent. ©2013 – Erick Pranata

8 Adjancency List (Modern)
©2013 – Erick Pranata

9 Adjacency Matrix (Tradisional)
©2013 – Erick Pranata

10 Adjacency Matrix (Modern)
©2013 – Erick Pranata

11 Think! Kapan sebuah representasi cocok untuk digunakan? Jenis Graph
Kompleksitas (Big O Analysis) Sparse atau tidak Jenis Graph Direction: Directed Undirected Weight Weighted Unweighted Bagaimanakah representasinya? ©2013 – Erick Pranata

12 Adjacency Matrix (Directed, Unweighted)
©2013 – Erick Pranata

13 Adjacency Matrix (Directed, Weighted)
©2013 – Erick Pranata

14 Adjacency Matrix (Bentuk Lain)
©2013 – Erick Pranata

15 Adjacency Matrix (Undirected, Unweighted)
©2013 – Erick Pranata

16 Adjacency Matrix (Directed, Unweighted)
©2013 – Erick Pranata

17 Adjacency Matrix (Directed, Weighted)
? ©2013 – Erick Pranata