A practical demonstration of graph traversals using sample cities in Ghana as use cases. Informed Searching Algorithms implemented include:
- Depth First Search
- Breadth First Search
- Uniform Cost Search
Uninformed Searching Algorithms implemented also include:
- Greedy Best First Search
- A* Searching Algorithm
- A less populated (simple) map
- A much complex map
- Accra
- Tema
- Achimota
- Kasoa
- Dansoman
- Mamprobi
- Kaneshie
- Boduase
- Mankessim
- Accra
- Tema
- Achimota
- Kasoa
- Dansoman
- Mamprobi
- Kaneshie
- Boduase
- Mankessim
- Korle Gono
- James Town
- Russia
- Bubuashie
- Tesano
- Kakum
- Elmina
- Cape Coast
- Takoradi
All these cities are goal states and the algorithms find paths to these goal states
This Program has two run modes:
- Console mode
- Gui mode
To run the GUI part of the program, run the searcheron.py file.
To run the console part of the program, run the console_test.py file after uncommenting lines 180 and 181 in plot_utils.py.
- Python 2.7 - Code was only tested in Python2.7. I cannot confirm if it run in other Python Versions or not.
- PyQt4 - (How to install PyQt4 in Python2.7 can be found in requirements.txt file)
Traversing the Map from the initial city (Accra) to Boduase using Depth First Search on the Simple Map.
Traversing the Map from the initial city (Accra) to Kaneshie using Depth First Search on the Complex Map
Traversing the Map from the initial city (Accra) to Kakum using Uniform Cost Search on the Complex Map. (On the console beneath the GUI is a list of cities traversed)
Traversing the Map from the initial city (Accra) to Kakum using Depth First Search on the Complex Map. (On the console beneath the GUI is a list of cities traversed)
