Loro-lorone iku linear ADT kanthi O(1) ing pamungkase, nanging urutan ngilangna iku beda: stack iku LIFO (paling anyar dhisik), antrian iku FIFO (paling lawas dhisik). Cocokake struktur karo urutan sing dibutuhake masalahmu.
Stack (LIFO): push 1,2,3 -> pop order 3,2,1
Queue (FIFO): enq 1,2,3 -> deq order 1,2,3
| Gunakake STACK nalika... | Gunakake QUEUE nalika... |
|---|
| Urungake/Ulang (aksi paling anyar dhisik) | Penjadwalan job (urutan teka) |
| Tombol mundur browser | Antrian cetak / antrian tugas |
| Panggilan fungsi/rekursi | BFS / jalur paling pendek ing grafik |
| Kecocokan kurung, parsing | Buffering pesen antarane layanan |
| DFS (jelajahi paling jero dhisik) | Rate limiting / panganan panjaluk |
# DFS uses a stack: explore newest branch first
stack = [start]
while stack:
node = stack.pop() # LIFO -> goes deep
for nb in graph[node]: stack.append(nb)
# BFS uses a queue: explore nearest first
from collections import deque
q = deque([start])
while q:
node = q.popleft() # FIFO -> goes level by level
for nb in graph[node]: q.append(nb)
Pilihan LIFO-vs-FIFO langsung ngarubah tingkah laku algoritma: traversal grafik sing padha dadi DFS karo stack utawa BFS karo antrian.
Ngenali apa masalahmu butuh "paling anyar" utawa "paling lawas dhisik" langsung nuduhake struktur sing bener.