Definitions from Wikipedia (Bidirectional search)

▸ noun:  a graph search algorithm that finds a shortest path from an initial vertex to a goal vertex in a directed graph.


▸ Words similar to bidirectional search
▸ Usage examples for bidirectional search

▸ Idioms related to bidirectional search
▸ Wikipedia articles (New!)
▸ Words that often appear near bidirectional search
▸ Rhymes of bidirectional search

▸ Invented words related to bidirectional search