navjindervirdee / advanced-shortest-paths-algorithms Goto Github PK

int q = in.nextInt(); //number of queries.

//get the queries
    for (int i = 0; i < q; i++) {
        int s, t;
        s = in.nextInt()-1;   //source vertex
        t = in.nextInt()-1;   //target vertex/
	
    System.out.println(computeDistance(graph,reverseGraph,s,t,i));
}