Best-First Search Visualizer: Step-by-Step Animation & Complexity

Best-First Search

Category: Tree / Graph | Time: O(n log n) | Space: O(n)

Input Data

Visualization

Visual representation of the data structure

Enter tree data to start visualization.

About Best-First Search

A graph search algorithm which explores a graph by expanding the most promising node chosen according to a specified rule. It uses a priority queue to select the next node to visit based on a heuristic cost.

Code Editor

The code is for reference. Editing it won't affect the visualization.

function bestFirstSearch(startNode, target) {
    let pq = new PriorityQueue();
    pq.add(startNode);
    let visited = new Set();

    while (!pq.isEmpty()) {
        let currentNode = pq.poll(); // Get node with best score

        if (currentNode === target) return "Found!";
        
        visited.add(currentNode);

        for (let neighbor of currentNode.neighbors) {
            if (!visited.has(neighbor)) {
                pq.add(neighbor);
            }
        }
    }
    return "Not Found";
}

Frequently Asked Questions

About Best-First Search

What is Best-First Search?

How does Best-First Search work?

What is a 'heuristic' in this context?

Is Best-First Search optimal?

How is it different from Dijkstra's and A* Search?

What is the time complexity of Best-First Search?

What is the space complexity?

What data structures are needed?

Where can I learn more?