Zote ni ADT za mstari na O(1) katika ncha, lakini utaratibu wa kuondolewa ni kinyume: stack ni LIFO (ya hivi karibuni kwanza), foleni ni FIFO (ya zamani kwanza). Linganisha muundo na utaratibu unaoohitajika na tatizo lako.
Stack (LIFO): push 1,2,3 -> pop order 3,2,1
Queue (FIFO): enq 1,2,3 -> deq order 1,2,3
| Tumia STACK lini... | Tumia QUEUE lini... |
|---|
| Undo/redo (kitendo cha hivi karibuni kwanza) | Kupanga kazi (mpangilio wa kuwasili) |
| Kitufe cha kurudi nyuma katika kipeperushi | Foleni ya kichapi / foleni ya kazi |
| Wito wa kazi/kujirudia | BFS / njia fupi zaidi kwenye grafu |
| Kulinganisha mabano, kuchanganua | Kuchagia ujumbe kati ya huduma |
| DFS (kugurudumika kwa kina kwanza) | Kuzuia kiwango / kushughulikia maombi |
# 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)
Chaguo la LIFO-dhidi-ya-FIFO linabadilisha moja kwa moja tabia ya algoriti: njia sawa ya kupigia grafu inakuwa DFS na stack au BFS na foleni.
Kutambua kama tatizo lako linahitaji "ya hivi karibuni" au "ya zamani kwanza" linakuelezeana moja kwa moja na muundo sahihi.