Country Graph Studio

Atlas Pathfinder

Explore BFS, DFS, and UCS on a Pakistan-inspired road network. Each edge includes a travel cost so you can compare shortest paths by hops and by weight.

Cities 0
Routes 0

Inputs

Search algorithm

BFS and DFS ignore edge weights while searching. UCS always expands the lowest cost frontier.

Graph canvas

Hover a node to see the full city name.

N
Start
Goal
Selected path

Results

Selected algorithm
--
Path found
--
Total cost
--
Steps (expanded nodes)
--
Runtime (ms)
--
Theoretical complexity
--
Expanded order
--

Comparison snapshot

BFS

Fast for fewest hops. Costs are ignored during the search.

DFS

Goes deep quickly. Path depends heavily on neighbor order.

UCS

Finds the lowest total cost route using a priority queue.