ikp213-07-stl

597 views

Published on

Published in: Technology, Education
0 Comments
0 Likes
Statistics
Notes
  • Be the first to comment

  • Be the first to like this

No Downloads
Views
Total views
597
On SlideShare
0
From Embeds
0
Number of Embeds
3
Actions
Shares
0
Downloads
15
Comments
0
Likes
0
Embeds 0
No embeds

No notes for slide

ikp213-07-stl

  1. 1. BAHASA PEMROGRAMAN(IKP213)Pertemuan 7: STL map13 Desember 2011
  2. 2. Algoritme Dijkstra2  Graf  Himpunan verteks / node  Himpunan edge  Graf berbobot  Edge memiliki nilai / bobot  Diberikan graf berbobot, verteks tujuan dan verteks awal  Cari jarak terpendek dari verteks awal ke verteks tujuan STL – IKP213
  3. 3. Algoritme Dijkstra3  contoh graf sederhana untuk pembahasan STL – IKP213
  4. 4. STL map4  (key, value) pair  contoh deklarasi  contoh assignment  contoh iterator STL – IKP213
  5. 5. Representasi Adjacency Map5 STL – IKP213
  6. 6. Iterator of Iterator6 STL – IKP213
  7. 7. Implementasi Dijkstra Algorithm7 STL – IKP213
  8. 8. Pustaka8  STL Tutorial, http://www.yolinux.com/TUTORIALS/LinuxTutorialC++STL.html  STL Tutorial, http://www.mochima.com/tutorials/STL.html  STL Reference, http://www.cplusplus.com/reference/stl/  http://tjerdastangkas.blogspot.com/search/label/ikp213 STL – IKP213
  9. 9. AKHIR PERTEMUAN 7Selasa, 13 Desember 2011

×