* @brief Function runs the dijkstra algorithm for some source vertex and * target vertex in the graph and returns the shortest distance of target * from the source. * * @param adj1 input graph * @param adj2 input graph reversed * @param s source vertex * @param t target vertex * * @return shortest distance if target is reachable from source else -1 in * case if target is not reachable fr
source not stored for this graph (policy: none)