bilalulhaque/Greedy-Best-First-Search bilalulhaque/Greedy-Best-First-Search

  • Stars
    star
    1
  • Language
    Python
  • Created over 3 years ago
  • Updated over 3 years ago
Twitter logo Share LinkedIn logo Share Facebook logo Share
bilalulhaque/Greedy-Best-First-Search
github

bilalulhaque

Reviews

There are no reviews yet. Be the first to send feedback to the community and the maintainers!

Repository Details

The concept behind Greedy Best First Search is to perform an evaluation function to determine which nearby is most promising and then explore it. It checks from the current node which of the neighbors has the lowest heuristic and then explores it. Best first search uses the concept of a priority queue and heuristic search.

More Repositories

1

Uniform-Cost-Search

Uniform-cost search is a search method that is used to traverse a weighted tree or graph. When each edge has a distinct cost, this algorithm is activated. The uniform-cost search's primary aim is to identify the path to the goal node with the lowest cumulative cost. Uniform-cost search grows nodes based on their route costs from the root node. It may be used to solve any graph or tree when the best cost is desired. The priority queue implements a uniform-cost search method. It puts the highest importance to the lowest total cost. If the route cost of all edges is the same, uniform cost search is identical to BFS algorithm.
Python
1
star