Graph Traversal Simulator
BFS & DFS — Goal Path Finder
Produced By
Ali Raza & Muhammad Waqas
🔵 BFS — Breadth First Search
Queue · Level by level · Shortest path guarantee
🟣 DFS — Depth First Search
Stack · Depth first · Ek path par aakhir tak
BFS:
Queue (FIFO) use karta hai. Level by level chalta hai. Agar goal milta hai toh
guaranteed shortest path
milta hai (unweighted graph mein).
⚙️ Graph Setup
Nodes (comma separated)
Edges (A-B, B-C ...)
Directed?
Undirected
Directed
🟢 Source (Start)
→
🔴 Goal (Target)
Goal Mode ON — path dhundha jayega
📌 Preset Graphs
🌳 Tree
🔄 Cycle
🔲 Grid
📝 Exam
📏 Long Path
❌ No Path
🗺️ Romania Map
🟢 Punjab Map
Animation Speed
Normal
Fast
Slow
Rebuild Graph
🔄 Graph Build Karo
▶ BFS Chalao — A → G
—
Total Nodes
—
Visited
—
Edges
—
Levels
—
Path Length
🎯 Goal Found! — Shortest/Found Path
❌ Goal node tak koi path nahi mila! Graph mein source se goal disconnected hai.
📦 Queue State (FIFO)
—
✅ Visited Order
—
🗺️ Graph Visual
Unvisited
In Queue/Stack
Visited
Current/Goal
Path Edge
📋 Exam-Style Step Log
Graph banao aur chalao...
📋 Adjacency List
—