{"version":"1.0","type":"link","title":"Bidirectional search - Newikis","description":"In computer science, bidirectional search is a method used for finding the shortest path between two items in a graph. It runs two simultaneous searches starting from the two items.","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400}