1 / 3

MODUL KULIAH STRUKTUR DATA

MODUL KULIAH STRUKTUR DATA. TANGGAL REVISI TANGGAL BERLAKU KODE DOKUMEN. : : :. ---- 04 September 2006 ----. 4. INCEDENCE MATRIX Menggambarkan hubungan antara simpul dan busur. Ukuran : I [ n x m ] jumlah busur. dimana n = jumlah simpul , m =. V2. e3. e1. V3. e4. e7

mai
Download Presentation

MODUL KULIAH STRUKTUR DATA

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. MODUL KULIAH STRUKTUR DATA TANGGAL REVISI TANGGAL BERLAKU KODE DOKUMEN : : : ---- 04 September 2006 ---- 4. INCEDENCE MATRIX Menggambarkan hubungan antara simpul dan busur. Ukuran : I [ n x m ] jumlah busur dimana n = jumlah simpul , m = V2 e3 e1 V3 e4 e7 e6 V1 e2 V5 e5 V4 e1 e2 e3 e4 e5 e6 e7 1 1 1 0 0 0 0 0 1 0 0 0 0 0 1 0 1 1 0 0 1 0 0 1 0 1 1 0 0 0 1 1 0 1 0 1 I = 2 3 4 5 Session 14 Edited By Al-Bahra. L.B, S. Kom, M. Kom http://www.mercubuana.ac.id Pertemuan Ke : 14 / Page 1 - 7

  2. MODUL KULIAH STRUKTUR DATA TANGGAL REVISI TANGGAL BERLAKU KODE DOKUMEN Bobot : : : ---- 04 September 2006 ---- Lintasan Alternatif : 1 2 5 15 1 2 3 5 24 1 2 3 1 4 5 1 4 3 1 4 3 4 5 2 5 5 29 16 19 22 Diperoleh : Lintasan Kritis = 29 Lintasan Terpendek = 15 2. Minimum Spanning Tree G’ SubGraph dari G Bobot : 10+6+5+9 =30 Membentuk struktur pohon spanning tree dari G 2 6 10 3 5 1 4 Session 14 G’ SubGraph dari G Pertemuan Ke : 14 / Page 3 - 7 5 9 Edited By Al-Bahra. L.B, S. Kom, M. Kom http://www.mercubuana.ac.id

  3. MODUL KULIAH STRUKTUR DATA TANGGAL REVISI TANGGAL BERLAKU KODE DOKUMEN : : : ---- 04 September 2006 ---- PENELUSURAN GRAPH Dapat dilakukan dengan 2 cara : 1. 2. Depth First Search (DFS) Breadth First Search (BFS) 1. Depth First Search (DFS) V1 V2 V4 V3 V7 V5 V6 V8 Graph takTerarah Pertanyaan : 1. TentukanHasilpenelusuranmenggunakan DFS dan BFS dimulaidari V1 2. BuatAdjencyListnya Session 14 Edited By Al-Bahra. L.B, S. Kom, M. Kom http://www.mercubuana.ac.id Pertemuan Ke : 14 / Page 5 - 7

More Related