A* search algorithm
id:
a-search-algorithm-174-12411309
title:
A* search algorithm
text:
A* is a graph traversal and pathfinding algorithm, which is used in many fields of computer science due to its completeness, optimality, and optimal efficiency. Given a weighted graph, a source node and a goal node, the algorithm finds the shortest path from source to goal. One major practical drawback is its O space complexity where d is the depth of the solution and b is the branching factor, as it stores all generated nodes in memory. Thus, in practical travel-routing systems, it is generally
brand slug:
wiki
category slug:
encyclopedia
description:
Algorithm used for pathfinding and graph traversal
original url:
https://en.wikipedia.org/wiki/A*_search_algorithm
date created:
2002-10-07T18:12:16Z
date modified:
2024-09-03T01:52:00Z
main entity:
{"identifier":"Q277680","url":"https://www.wikidata.org/entity/Q277680"}
image:
fields total:
13
integrity:
15