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.
As the title says.. What is the most efficient way to store a connected graph in java?
For example lets say I have multiple locations connecting to each other in various ways and I have to traverse through the graph to see if it’s connected.. any help/comment would be helpful thanks!
One often used representation is a matrix (two dimensional array) indexed by all the nodes in the graph, where
M[i,j] == trueif there is a directed edge from nodeitoj. A variation on the theme is to store the length / weight of the edge between the two nodes (where a missing edge may be represented by the value -1).