Jisho

×
双方向探索
Wikipedia definition
1. Bidirectional searchBidirectional 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 in the middle.
Read “Bidirectional search” on English Wikipedia
Read “双方向探索” on Japanese Wikipedia
Read “Bidirectional search” on DBpedia

Discussions

to talk about this word.