UCS With Best First Search

Project information

Implementation of UCS on Romania to find shortest distance from Arad to Bucharest based on best-first search algorithm. It uses a dictionary that stores current city mapped to (parent city, current best distance), and frontier is a priority queue to process nodes containing (node id, current city, priority value).

Python python-3 python3

+ 9 more

11 Commits
1 Branch
0 Tags

README

Created on

August 02, 2024

Copy SSH clone URLgit@gitlab.com:jaiswalchitransh/UCS-with-Best-First-Search.git
Copy HTTPS clone URLhttps://gitlab.com/jaiswalchitransh/UCS-with-Best-First-Search.git

Loading