SolveSphere
Home
Solusaun
AI Agent
Team
About
Agente AI – v3.0 Ativu
AI Agent
Problem Solving & Search
Simulador interativu BFS, DFS, A* ho agente intelijente iha Tetun
🔵 BFS
🟣 DFS
⭐ A* Search
BFS Simulator
Breadth-First Search
Lais:
🐢
⚡
🚀
Modu:
🧱 Muran
🟢 Inísiu
🔴 Meta
|
🌀 Labyrinth
🗑 Hamoos
La vizita
Vizita agora
Iha Queue
Vizita tiha
Dalan
Muran
// BFS prontu — klik ▶ Hahú
// Klik/drag grid atu tau muran | Moda: muran/inísiu/meta
Hahú
Para
Reset
0
Vizitu
0
Queue
0
Pasu
📖 Kona ba BFS
Breadth-First Search
esplora grafu nivel husi nivel — hanesan oan rai bee espalla iha sorin hotu. Uza
Queue (FIFO)
.
Queue: [A] → pop A → push B,C → pop B → push D,E → ...
Garantia:
BFS sempre hetan dalan
badak liu
bainhira kustu aresta igual.
Tempu
O(V+E)
Espasu
O(V)
Kompletu?
✅ Sin
Optimál?
✅ Sin
DFS Simulator
Depth-First Search
Lais:
🐢
⚡
🚀
Modu:
🧱 Muran
🟢 Inísiu
🔴 Meta
|
🌀 Labyrinth
🗑 Hamoos
La vizita
Vizita agora
Iha Stack
Vizita tiha
Dalan
Muran
// DFS prontu — klik ▶ Hahú
// Klik/drag grid atu tau muran | DFS uza Stack (LIFO)
Hahú
Para
Reset
0
Vizitu
0
Stack
0
Pasu
📖 Kona ba DFS
Depth-First Search
esplora ho fundu oin — tuun dalan ida to'o finais, depois fila (backtrack). Uza
Stack (LIFO)
.
Stack: push(A) → pop A → push C,B → pop B → push E,D → pop D ...
Avizu:
DFS la garantia dalan badak.
Tempu
O(V+E)
Espasu
O(D)
Kompletu?
⚠ Limitadu
Optimál?
❌ Lae
A* Simulator
A* Heuristic Search
Lais:
🐢
⚡
🚀
Modu:
🧱 Muran
🟢 Inísiu
🔴 Meta
|
🌀 Labyrinth
🗑 Hamoos
La vizita
Vizita agora
Lista Aberta
Lista Taka
Dalan
Muran
// A* prontu — klik kanvas atu tau muran, depois Hahú
// f(n) = g(n) + h(n) | h = Manhattan distance
Hahú
Para
Reset
0
Aberta
0
Taka
–
Dalan
📖 Kona ba A* Search
A* Search
kombina kustu real
g(n)
ho estimasaun
h(n)
atu hetan dalan otimál ho efisiensia.
f(n) = g(n) + h(n)
g(n) = kustu real husi inísiu → n
h(n) = Manhattan: |r1−r2| + |c1−c2|
Bainhira
h(n)
admissible, A*
sempre otimál no kompletu
.
Tempu
O(b^d)
Espasu
O(b^d)
Kompletu?
✅ Sin
Optimál?
✅ Sin
SolveAgent PSS
● Ativu – Prontu atu ajuda
👋
Olá! Hau mak SolveAgent.
Hau mak espesialista ba
BFS, DFS no A*
. Bele husu kona ba:
🔵
BFS
– oinsá funsiona, kuandu uza
🟣
DFS
– fundu-oin, backtracking
⭐
A*
– heuristic, formula f(n)
📊
Kompleksidade
– Big-O
⚖️
Komparasaun
– diferensa
Halo pergunta! 😊
Ohin · SolveAgent
Saida mak BFS?
Oinsá DFS funsiona?
Explika A* ba hau
BFS vs DFS diferensa
Saida mak heuristic?
Kompleksidade nusaa?
Kuandu uza A*?
Queue vs Stack diferensa