A cikin gida'a masu nauyi (digraph), gefunan suna da shugabanci (A → B ≠ B → A). A cikin gida'a masu nauyi, kowane gefe yana ɗaukar (nesa, lokaci, iyawa). Haɗa su duka yana yin aiki na jiya inda alaka suke aiki-daya kuma suna da nauyi.
A cikin gida'a masu nauyi (digraph), gefunan suna da shugabanci (A → B ≠ B → A). A cikin gida'a masu nauyi, kowane gefe yana ɗaukar (nesa, lokaci, iyawa). Haɗa su duka yana yin aiki na jiya inda alaka suke aiki-daya kuma suna da nauyi.
Weighted directed graph:
A --5--> B
A --2--> C
C --1--> B
Adjacency list with weights:
A: [(B,5), (C,2)]
B: []
C: [(B,1)]
graph = {
'A': [('B', 5), ('C', 2)], # directed, weighted edges
'B': [],
'C': [('B', 1)],
}
# Shortest A->B is A->C->B = 2 + 1 = 3, not the direct edge 5.
| Yanki | Gida | Gefunan masu nauyi da shugabanci |
|---|---|---|
| Taswira / GPS | mahaɗan | hanyoyin aiki-daya + lokacin tafiya |
| Sadarwa | dillali | haɗi + latency/bandwidth |
| Shirye-shiryen aiki | ayyuka | dogara + tsawo |
| Kuɗi | bukatun | masu sauya-jiya |
| Burin | Algorithm | Hadadi |
|---|---|---|
| Taƙaitaccen hanya (mafi nauyi ba-mara) | Dijkstra | O((V+E) log V) |
| Taƙaitaccen hanya (gefunan ba-mara) | Bellman-Ford | O(VE) |
| Tsari tare da dogara | Topological sort | O(V+E) |
| Ware alaƙa / jitsawa | DFS | O(V+E) |
Shugabanci da nauyi su ne abin da ke juyar gida'a marar jiya zuwa aiki mai ba'a na tafiya, shirye-shirye, da matsalolin dogara da ke bugi aikace-aikacen gaske.
Zabin algorithm yana danganta da waɗannan abu — alal misali, gefunan ba-mara suna ƙeta Dijkstra kuma suna buƙatar Bellman-Ford.
Ɗakin karatu na tambayoyin hira na IT tare da amsoshi cikakke — daga Junior zuwa Senior.
Ba da Gudummawa