Create a graph given in the above diagram
V = 4 NEW_LINE adj = [ [ ] for i in range ( V + 1 ) ] NEW_LINE addEdge ( 0 , 1 ) NEW_LINE addEdge ( 0 , 2 ) NEW_LINE addEdge ( 1 , 2 ) NEW_LINE addEdge ( 2 , 0 ) NEW_LINE addEdge ( 2 , 3 ) NEW_LINE addEdge ( 3 , 3 ) NEW_LINE u , v = 1 , 3 NEW_LINE if ( isReachable ( u , v ) ) : NEW_LINE INDENT print ( " There ▁ is ▁ a ▁ path ▁ from " , u , " to " , v ) NEW_LINE DEDENT else : NEW_LINE INDENT print ( " There ▁ is ▁ no ▁ path ▁ from " , u , " to " , v ) NEW_LINE DEDENT