Scribd
Upload
31 views3 pages

2-Best First Search (Informed Search)

Best First Search (BFS) is an informed search algorithm that uses an evaluation function to prioritize which adjacent node to explore next, utilizing a priority queue for implementation. The algorithm processes nodes based on their costs, aiming to find the lowest cost path to the goal. It has a worst-case time complexity of O(n * log n) and includes special cases like Greedy Best First Search and A* search algorithm.

Uploaded by

shubhrajkumar707
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
31 views3 pages

2-Best First Search (Informed Search)

Best First Search (BFS) is an informed search algorithm that uses an evaluation function to prioritize which adjacent node to explore next, utilizing a priority queue for implementation. The algorithm processes nodes based on their costs, aiming to find the lowest cost path to the goal. It has a worst-case time complexity of O(n * log n) and includes special cases like Greedy Best First Search and A* search algorithm.

Uploaded by

shubhrajkumar707
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Best First Search (Informed Search)

Last Updated : 21 Dec, 2023

In BFS and DFS, when we are at a node, we can consider any of the adjacent as the next node. So both BFS and DFS blindly explore
paths without considering any cost function.

The idea of Best First Search is to use an evaluation function to decide which adjacent is most promising and then explore.

Best First Search falls under the category of Heuristic Search or Informed Search.

Implementation of Best First Search:

We use a priority queue or heap to store the costs of nodes that have the lowest evaluation function value. So the implementation is a
variation of BFS, we just need to change Queue to PriorityQueue.

// Pseudocode for Best First Search


Best-First-Search(Graph g, Node start)
1) Create an empty PriorityQueue
PriorityQueue pq;
2) Insert "start" in pq.
pq.insert(start)
3) Until PriorityQueue is empty
u = PriorityQueue.DeleteMin
If u is the goal
Exit
Else
Foreach neighbor v of u
If v "Unvisited"
Mark v "Visited"
pq.insert(v)
Mark u "Examined"
End procedure

Illustration:

Let us consider the below example:

Best First Search (Informed Search)

We start from source “S” and search for goal “I” using given costs and Best First search.

pq initially contains S

We remove S from pq and process unvisited neighbors of S to pq.

pq now contains {A, C, B} (C is put before B because C has lesser cost)

We remove A from pq and process unvisited neighbors of A to pq.


pq now contains {C, B, E, D}

We remove C from pq and process unvisited neighbors of C to pq.

pq now contains {B, H, E, D}

We remove B from pq and process unvisited neighbors of B to pq.

pq now contains {H, E, D, F, G}

We remove H from pq.


Since our goal “I” is a neighbor of H, we return.

Below is the implementation of the above idea:

C++ Java Python3 C# Javascript

// C++ program to implement Best First Search using priority


// queue
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pi;

vector<vector<pi> > graph;

// Function for adding edges to graph


void addedge(int x, int y, int cost)
{
graph[x].push_back(make_pair(cost, y));
graph[y].push_back(make_pair(cost, x));
}

// Function For Implementing Best First Search


// Gives output path having lowest cost
void best_first_search(int actual_Src, int target, int n)
{
vector<bool> visited(n, false);
// MIN HEAP priority queue
priority_queue<pi, vector<pi>, greater<pi> > pq;
// sorting in pq gets done by first value of pair
pq.push(make_pair(0, actual_Src));
int s = actual_Src;
visited[s] = true;
while (!pq.empty()) {
int x = pq.top().second;
// Displaying the path having lowest cost
cout << x << " ";
pq.pop();
if (x == target)
break;

for (int i = 0; i < graph[x].size(); i++) {


if (!visited[graph[x][i].second]) {
visited[graph[x][i].second] = true;
pq.push(make_pair(graph[x][i].first,graph[x][i].second));
}
}
}
}

// Driver code to test above methods


int main()
{
// No. of Nodes
int v = 14;
graph.resize(v);

// The nodes shown in above example(by alphabets) are


// implemented using integers addedge(x,y,cost);
addedge(0, 1, 3);
addedge(0, 2, 6);
addedge(0, 3, 5);
addedge(1, 4, 9);
addedge(1, 5, 8);
addedge(2, 6, 12);
addedge(2, 7, 14);
addedge(3, 8, 7);
addedge(8, 9, 5);
addedge(8, 10, 6);
addedge(9, 11, 1);
addedge(9, 12, 10);
addedge(9, 13, 2);

int source = 0;
int target = 9;

// Function call
best_first_search(source, target, v);

return 0;
}

Output

0 1 3 2 8 9

Analysis :

The worst-case time complexity for Best First Search is O(n * log n) where n is the number of nodes. In the worst case, we may have
to visit all nodes before we reach goal. Note that priority queue is implemented using Min(or Max) Heap, and insert and remove
operations take O(log n) time.
The performance of the algorithm depends on how well the cost or evaluation function is designed.

Special cases of Best first search:

1. Greedy Best first search algorithm


2. A* search algorithm

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy