Create a graph in the above diagram
adj = vector < vector < int > > ( n ) ; addEdge ( 0 , 1 ) ; addEdge ( 0 , 2 ) ; addEdge ( 1 , 2 ) ; addEdge ( 2 , 0 ) ; addEdge ( 2 , 3 ) ; addEdge ( 3 , 3 ) ; int u = 1 , v = 3 ; if ( isReachable ( u , v ) ) cout << " There is a path from " ▁ < < ▁ u ▁ < < ▁ " to " ▁ < < ▁ v ; STRNEWLINE else STRNEWLINE cout ▁ < < ▁ " There is no path from " ▁ < < ▁ u ▁ < < ▁ " to " return 0 ; }