Bidirectional Search

0

0 votes
Easy
Problem

Solve Q1 of assignment 2 by using a bidirectional search. Print only the cost and not the path. 

Sample Input
1
3 3
IIT1 IIT2 IIT3 IIT4 IIT5 IIT6 IIT7 IIT8 IIT9
IIT2 IIT6 IIT4 IIT1 IIT5 IIT3 IIT7 IIT8 IIT9
Sample Output
4
Time Limit: 10
Memory Limit: 1024
Source Limit:
Editor Image

?