Iha Algortima barak hodi rezolve ka solusiona problema, iha algoritma hanesan BFS, DFS, A*, Dijkstra. Algoritma hirak ne’e fasilita ita hodi rezolve ita nia problema ho lais no efisiente, uza maneira husi algoritma hirak ne’e.
Iha ne'e iha algoritma hirak ne'ebe baibain utilija
Breadth-First Search
Breadth-First Search maka algoritmu ba buka (seacrhing) iha graf ka ai-strutura tuir nivel husi node inisial, uza queue, no garante buka dalan ne'ebe badak liu
Depth-First Search
Depth-First Search maka algoritmu ba buka (seacrhing) iha graf ka ai-strutura, DFS uza stack ka rekursaun no nia diak liu ba graf ne'ebe klean tebes no la presija hetan dalan ne'ebe badak liu
A* Search
A* (A-star) Search mak algoritmu buka dalan badak liu husi pontu hahú ba pontu objetivu ho dalan neebé efisiente liu. Algoritmu nee halo kombinasaun entre kustu neebé já passa ho estimasaun kustu ba objetivu.
Dijkstra's Algorithm
lgoritmu Dijkstra mak algoritmu buka dalan badak liu husi pontu ida (source) ba pontu seluk iha grafu, ho kondisaun katak kustu (peso) hotu-hotu la bele negativu.
BFS is a graph traversal algorithm that explores all neighbor nodes at the present depth before moving on to nodes at the next depth level.
DFS explores as far as possible along each branch before backtracking. It uses a stack data structure.
A* uses heuristics to find the optimal path by minimizing f(n) = g(n) + h(n).
Finds the shortest path between nodes in a graph with non-negative edge weights.