Design an algorithm that generates a maze that contains no path from start to finish but has the property that the removal of a prespecified wall creates a unique path. Prove that Kruskal’s algorithm is correct. In your proof do you assume that the edge costs are nonnegative?
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here