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.
I am currently working on developing an application to find the maximum clique in a graph for my final year project. I have most the project complete and am just starting to test the application.
The application currently uses an adjacency list as an input and I was wondering if anyone knew of an adjacency list random generator, so I can test my application?
Many thanks
This problem is much easier to address if you think about the graphs in terms of adjacency matrices rather than adjacency lists. A graph with
mvertices can be represented by anmbymmatrix where each edge is 0 if it is absent, or 1 if it is present.For a directed graph, all elements are required, but for an undirected graph, you’ll need a upper triangular matrix.
Once you’ve got the adjacency matrix, you can easily convert it to adjacency lists.