Skip to content
#

heuristics

Here are 601 public repositories matching this topic...

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).

  • Updated Feb 14, 2024
  • Python

Improve this page

Add a description, image, and links to the heuristics topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the heuristics topic, visit your repo's landing page and select "manage topics."

Learn more