Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
SlideShare a Scribd company logo

Dwi putri erlinda saraswati

•Download as DOCX, PDF•
•

The document discusses finding the minimum spanning tree from a graph. It provides the steps taken which include initializing an empty set C, adding edges to C based on the lowest distance values between nodes, and calculating the total distance of the minimum spanning tree. It is determined that the minimum spanning tree has a total distance of 17 based on the provided node distances.

1 of 5
Tugas :Mencari Minimum Spanning Tree darigambar di bawah 1) C = ∅ C’ = 2) C = C’ = d(A,B) = 2 d(A,E) = 10 d(A,C) = 4 d(A,F) = d(A,D) = 1 d(A,G) = 3) C = C’ = d(A,B) = 2 d(D,B) = 1 d(A,C) = 4 d(D,C) = 4 d(A,E) = 10 d(D,E) = 7 d(A,F) = d(D,F) = 10 d(A,G) = d(D,G) = 7 4) C = C’ = d(A,C) = 4 d(D,C) = 4 d(B,C) = d(A,E) = 10 d(D,E) = 7 d(B,E) = d(A,F) = d(D,F) = 10 d(B,F) = d(A,G) = d(D,G) = 7 d(B,G) = 5) C = C’ = d(A,E) = 10 d(D,E) = 7 d(B,E) = d(A,F) = d(D,F) = 10 d(B,F) = d(A,G) = d(D,G) = 7 d(B,G) = 6) C = C’ = d(A,E) = 10 d(D,E) = 7 d(B,E) = d(A,F) = d(D,F) = 10 d(B,F) = 7) C = C’ = d(A,E) = 10 d(D,E) = 7 d(B,E) = 8) C = C’ = ∅ 1+1+4+3+3+5 = 17 Jadi minimum spanning tree-nyaadalah 17 DenganaplikasiTORA : d(C,E) = d(C,F) = d(C,G) = 3 d(C,E) = d(C,F) = - d(G,E) = 5 d(G,F) = 3 d(C,E) = - d(G,E) = 5 d(F,E) = 8
Dwi putri erlinda saraswati
Dwi putri erlinda saraswati
Dwi putri erlinda saraswati
Jadi Minimum Spanning Tree-nyaadalah 17.

More Related Content

Dwi putri erlinda saraswati

  • 1. Tugas :Mencari Minimum Spanning Tree darigambar di bawah 1) C = ∅ C’ = 2) C = C’ = d(A,B) = 2 d(A,E) = 10 d(A,C) = 4 d(A,F) = d(A,D) = 1 d(A,G) = 3) C = C’ = d(A,B) = 2 d(D,B) = 1 d(A,C) = 4 d(D,C) = 4 d(A,E) = 10 d(D,E) = 7 d(A,F) = d(D,F) = 10 d(A,G) = d(D,G) = 7 4) C = C’ = d(A,C) = 4 d(D,C) = 4 d(B,C) = d(A,E) = 10 d(D,E) = 7 d(B,E) = d(A,F) = d(D,F) = 10 d(B,F) = d(A,G) = d(D,G) = 7 d(B,G) = 5) C = C’ = d(A,E) = 10 d(D,E) = 7 d(B,E) = d(A,F) = d(D,F) = 10 d(B,F) = d(A,G) = d(D,G) = 7 d(B,G) = 6) C = C’ = d(A,E) = 10 d(D,E) = 7 d(B,E) = d(A,F) = d(D,F) = 10 d(B,F) = 7) C = C’ = d(A,E) = 10 d(D,E) = 7 d(B,E) = 8) C = C’ = ∅ 1+1+4+3+3+5 = 17 Jadi minimum spanning tree-nyaadalah 17 DenganaplikasiTORA : d(C,E) = d(C,F) = d(C,G) = 3 d(C,E) = d(C,F) = - d(G,E) = 5 d(G,F) = 3 d(C,E) = - d(G,E) = 5 d(F,E) = 8