1. We have assumed that there are no multiple edges in a graph, and therefore we could store simple true/false values in the adjacency matrix. Describe how adjacency matrixes might be used even if the graphs do have multiple edges.
2. Compare and contrast adjacency lists and edge lists.
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here