KeremTAN/UniformCostSearch-UCS-
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
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.
About
Calculating the shortest path between two nodes with the Uniform Cost Search algorithm.
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published