Using Best-First-Search | Breadth-First-Search | Depth-First-Search | Greedy-Best-First-Search | A-Star-Search algorithms to solve the Romanian problem
The agent is on holiday in Romania and is currently located in the city of Arad. Agent has a flight from Bucharest tomorrow, so it can't be changed. Now you need to find the shortest path to Bucharest.
An example of running the program:
