Are there any algorithms for which adjacency matrices outperform adjacency lists? What about vice versa?
Are there any algorithms for which adjacency matrices outperform adjacency lists? What about vice
Share
Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
Are there any algorithms for which adjacency matrices outperform adjacency lists? What about vice versa?
In terms of Running Time, Adjacency Matrix would almost always outperform lists. The List implementation would use less memory(proportional to number of edges) to store the Graph.
So if memory does matter(it surely would with sparse Graphs with large number of nodes), use lists. If run time matters, and the Graph is likely to be dense, use Adjacency Matrix.