Bidirectional search
id:
bidirectional-search-211-1495005
title:
Bidirectional search
text:
Bidirectional search is a graph search algorithm that finds a shortest path from an initial vertex to a goal vertex in a directed graph. It runs two simultaneous searches: one forward from the initial state, and one backward from the goal, stopping when the two meet. The reason for this approach is that in many cases it is faster: for instance, in a simplified model of search problem complexity in which both searches expand a tree with branching factor b, and the distance from start to goal is d
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Bidirectional_search
date created:
2005-11-14T11:37:47Z
date modified:
2024-09-11T22:18:50Z
main entity:
{"identifier":"Q59750","url":"https://www.wikidata.org/entity/Q59750"}
image:
fields total:
13
integrity:
14