Research any topic before you write.

Find related topics. | Discover entities. | See connections. | Build a topical map.

A* search algorithm

A* (pronounced "A-star") is a graph traversal and pathfinding algorithm that 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 (with respect to the given weights) from source to goal.

History, Applications & Science

Use the mouse wheel or two fingers (on touchscreens) to zoom in and out of the map.

Research this topic

Explore the main themes, entities and connections around A* search algorithm. Start with the topic map, then use the sections below for research and deeper semantic analysis.

Explore this topic

Start with a few of the strongest sections from the source topic. These are research directions, not a list of keywords you must use.

Key facts & relationships

High-confidence facts extracted from structured source data. Use them as anchors for further research.

Class
Search algorithm
Complete
yes
Data structure
Graph
Optimal
yes
Worst-case performance
O ( | E | log ⁡ | V | ) = O ( b d ) {\displaystyle O(|E|\log |V|)=O(b^{d})}
Worst-case space complexity
O ( | V | ) = O ( b d ) {\displaystyle O(|V|)=O(b^{d})}

Topics to explore

Browse the full topic structure. Each item opens a new analysis centered on that subject.

Overview

History

Description

Complexity

Applications

Relations to other algorithms

Variants

Advanced semantic analysis

Deeper signals for content research, entity SEO and topical coverage. The plain-language headings explain what each technical view is useful for.

Map overview Semantic statistics

A* search algorithm

Nodes66
Edges65
Triples18
Avg. degree1.97
Density0.030303
Components1

How this topic connects Entity context

See the strongest relationship patterns around the current topic before diving into the raw triples.

A* search algorithm

Top relations

related to External links · 10
A* search algorithm → Archived, Brian Grinstead, February, Hierarchical Path-Finding, HPA, JavaScript, Retrieved, Search Algorithm, Updated, Variation
Class · 1
A* search algorithm → Search algorithm
Complete · 1
A* search algorithm → yes
Data structure · 1
A* search algorithm → Graph
Optimal · 1
A* search algorithm → yes
Worst-case performance · 1
A* search algorithm → O ( | E | log ⁡ | V | ) = O ( b d ) {\displaystyle O(|E|\log |V|)=O(b^{d})}
Worst-case space complexity · 1
A* search algorithm → O ( | V | ) = O ( b d ) {\displaystyle O(|V|)=O(b^{d})}

Important terminology Word statistics

Use these terms to understand the vocabulary surrounding the topic, not as a checklist for keyword stuffing.

Important terminology

node algorithm heuristic path goal displaystyle search nodes optimal graph cost admissible textstyle consistent shortest function case distance start solution

Entity relationships Subject–Predicate–Object triples

SubjectPredicateObjectConfidenceSrc
A* search algorithmClassSearch algorithm1.00infobox
A* search algorithmCompleteyes1.00infobox
A* search algorithmData structureGraph1.00infobox
A* search algorithmOptimalyes1.00infobox
A* search algorithmWorst-case performanceO ( | E | log ⁡ | V | ) = O ( b d ) {\displaystyle O(|E|\log |V|)=O(b^{d})}1.00infobox
A* search algorithmWorst-case space complexityO ( | V | ) = O ( b d ) {\displaystyle O(|V|)=O(b^{d})}1.00infobox
video gamesinstance ofis often used for the common pathfinding problem in applications0.80text
but was originally designed as a general graph traversal algorithminstance ofis often used for the common pathfinding problem in applications0.80text
A* search algorithmrelated to External linksVariation0.60section
A* search algorithmrelated to External linksHierarchical Path-Finding0.60section
A* search algorithmrelated to External linksHPA0.60section
A* search algorithmrelated to External linksBrian Grinstead0.60section

Related concept clusters Concept neighborhoods

These clusters group vocabulary that occurs around closely connected concepts in the source material.

    Connections between topic areas Semantic bridges

    Bridges can reveal useful research angles that are easy to miss in a flat list of related terms.

    Min side: 3
    For writers, content strategists, SEOs, marketers and creators — from quick topic research to advanced semantic analysis.