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.
Is there a Graph generation library in Java which generators graphs (of different types) such that
G{n,p} graph chooses each of the possible [n(n-1)]/2 edges with probability p.
The closest I could find was NetworkX -Python package for the creation, manipulation, and study of the structure, dynamics, and functions of complex networks.
Well If I cant find anything good I might have to create my own random generator using jGraph or jgraphT
Well nevermind
I just used JgraphT to write a function which adds edges based on a probability p for each edge.