Struktur Data Graph
Definisi Tersusun atas: Edge Vertex Sebuah graph disebut connected jika setiap vertex memiliki degree minimal 1 ©2013 – Erick Pranata
Struktur Data untuk Graph Edge List Adjancency List Adjancency Matrix ©2013 – Erick Pranata
Representasikan Graph Berikut Ini! ©2013 – Erick Pranata
Edge List Menyimpan edges dan vertices dalam list yang tidak diurutkan. Edges juga dilengkapi dengan link ke vertices terkait. ©2013 – Erick Pranata
Edge List ©2013 – Erick Pranata
Adjacency List (Tradisional) Kumpulan vertices yang saling adjacent. ©2013 – Erick Pranata
Adjancency List (Modern) ©2013 – Erick Pranata
Adjacency Matrix (Tradisional) ©2013 – Erick Pranata
Adjacency Matrix (Modern) ©2013 – Erick Pranata
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
Adjacency Matrix (Directed, Unweighted) ©2013 – Erick Pranata
Adjacency Matrix (Directed, Weighted) ©2013 – Erick Pranata
Adjacency Matrix (Bentuk Lain) ©2013 – Erick Pranata
Adjacency Matrix (Undirected, Unweighted) ©2013 – Erick Pranata
Adjacency Matrix (Directed, Unweighted) ©2013 – Erick Pranata
Adjacency Matrix (Directed, Weighted) ? ©2013 – Erick Pranata