ikp213-07-stl
Upcoming SlideShare
Loading in...5
×
 

ikp213-07-stl

on

  • 514 views

 

Statistics

Views

Total Views
514
Views on SlideShare
514
Embed Views
0

Actions

Likes
0
Downloads
8
Comments
0

0 Embeds 0

No embeds

Accessibility

Categories

Upload Details

Uploaded via as Adobe PDF

Usage Rights

© All Rights Reserved

Report content

Flagged as inappropriate Flag as inappropriate
Flag as inappropriate

Select your reason for flagging this presentation as inappropriate.

Cancel
  • Full Name Full Name Comment goes here.
    Are you sure you want to
    Your message goes here
    Processing…
Post Comment
Edit your comment

    ikp213-07-stl ikp213-07-stl Presentation Transcript

    • BAHASA PEMROGRAMAN(IKP213)Pertemuan 7: STL map13 Desember 2011
    • 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
    • Algoritme Dijkstra3  contoh graf sederhana untuk pembahasan STL – IKP213
    • STL map4  (key, value) pair  contoh deklarasi  contoh assignment  contoh iterator STL – IKP213
    • Representasi Adjacency Map5 STL – IKP213
    • Iterator of Iterator6 STL – IKP213
    • Implementasi Dijkstra Algorithm7 STL – IKP213
    • 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
    • AKHIR PERTEMUAN 7Selasa, 13 Desember 2011