https://github.com/keremtan/uniformcostsearch-ucs-

Calculating the shortest path between two nodes with the Uniform Cost Search algorithm.
https://github.com/keremtan/uniformcostsearch-ucs-

algorithm computer-algorithm ucs uniform-cost-search

Last synced: 6 months ago
JSON representation

Calculating the shortest path between two nodes with the Uniform Cost Search algorithm.

• Host: GitHub
• URL: https://github.com/keremtan/uniformcostsearch-ucs-
• Owner: KeremTAN
• Created: 2021-12-08T00:26:29.000Z (almost 4 years ago)
• Default Branch: master
• Last Pushed: 2022-01-03T03:38:23.000Z (almost 4 years ago)
• Last Synced: 2025-02-15T09:20:45.634Z (8 months ago)
• Topics: algorithm, computer-algorithm, ucs, uniform-cost-search
• Language: Python
• Homepage:
• Size: 44.9 KB
• Stars: 4
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

          
# UniformCostSearch-UCS-

### With the Uniform Cost Search algorithm, we calculate the shortest distance between two desired nodes of a weighted graph as in the picture below. Here, our nodes become our cities and our weighted edges become the roads between our cities. 

![UML](https://github.com/KeremTAN/UniformCostSearch-UCS-/blob/master/img/cities.png)

### With the Uniform Cost Search algorithm, while going from the starting node to the target node, we continuously select the least cost edge until we find the node we are looking for. However, in the next step, we also check our previous node while selecting the shortest edge, and after calculating our cost cumulatively, we choose our new edge.