UniformCostSearch

Uniform Cost Search implemented for Artificial Intelligence course

About The Project

It is a project for Akdeniz University Computer Science Department - Artificial Intelligence Lesson.

Developed a program to find the best route based on cost between 2 cities of a map. Program takes cities from a .csv file. Example map & example lines of .csv file:

   city1,city2,distance
   Balıkesir,Çanakkale,95
   Çanakkale,İstanbul,125

The program calculates all routes from starting city to destination city. Prints the best route between this cities and cost of this route in km. It was implemented using Uniform Cost Search.

Uniform Cost Search

Uniform Cost Search is one of the best algorithms for a search problem. It is like Dijkstra Algorithm but it doesn’t store all route to queue, only stores the start point. When other cities were necessary, queue will store this cities. This algorithm gives the minimum cumulative cost the maximum priority. The pseudo code of algorithm using priority queue is:

Insert the root into the queue While the queue is not empty
Dequeue the maximum priority element from the queue
(If priorities are same, alphabetically smaller path will chosen) 
    If the path is ending in the goal state, print the path and exit Else
    Insert all the children of the dequeued element,
    with the cumulative costs as priority

Built With

Python

Getting Started

```
python3 ucs.py
```

Contributing

Contributions are what make the open source community such an amazing place to be learn, inspire, and create. Any contributions you make are greatly appreciated.