Page 217 - EMODUL INFORMATIKA XI FASE F

4. Tugas Struktur Data Kompleks

Kasus 1: Sistem Penjadwalan Tugas (Task Scheduler dengan
Priority Queue)

Deskripsi:

Tugas diprioritaskan berdasarkan tingkat urgensi (1 = tinggi, 5 =
rendah)

import heapq

task = []

heapq.heappush(task, (1, "Kerjakan PR"))

heapq.heappush(task, (3, "Bersih-bersih"))

print(heapq.heappop(task)) # Output: (1, "Kerjakan PR")
Kasus 2: Simulasi Google Maps (Grafik + Algoritma Dijkstra)

import networkx as nx

G = nx.Graph()

G.add_edge('A', 'B', weight=2)

G.add_edge('B', 'C', weight=1)

G.add_edge('A', 'C', weight=5)

path = nx.dijkstra_path(G, 'A', 'C')

print("Jalur tercepat:", path)

217