[
Skip Navigation]
≡
↩️
🗣️
-
🏠
Search
:
Wiki
:
a* search algorithm
≡
Welcome
Signin
Create Account
a* search algorithm@Search
View
Source
History
Discussion
Search Group
Create/Find Pages
Group Feed
My Groups
📖
Locale: en-US
Page: a* search algorithm
⚙
🗄️
Page Type:
Standard
Page and Feedback
Page Alias
Media List
Presentation
Url Shortener
Share Wall
Alias Page To:
Page Border:
Solid
Dashed
None
Table of Contents:
Title:
Author:
Meta Robots:
Meta Description:
Meta Properties (such as Open Graph)
One line per property in format: name|content
Header Page Name:
Footer Page Name:
== A* search algorithm == <br> A* (pronounced "A-star") is a graph traversal and path search algorithm, which is often used in many fields of computer science due to its completeness, optimality, and optimal efficiency. in turn, both Dijkstra and A* are special cases of dynamic programming. A* itself is a special case of a generalization of branch and bound. <br> [[https://en.wikipedia.org/wiki/A*_search_algorithm|More at Wikipedia...]]
X
(c) 2025 Yioop -
PHP Search Engine
