Design an algorithm to check whether the undirected graph is connected. If yes return 1, if no return 0.
Using the storage structure of adjacency list, write an algorithm to check whether there is a simple path with length k between any two given vertices of an undirected graph.
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here