# How to construct a random connected graph of given size

I have no idea how to make the graph connected. The output should be an adjacency matrix of given size n (number of nodes), and the matrix is a 2d array. The graph is unweighted and undirected. It'll be helpful if there's any code implementation (Java preferred, C/C++ would be great too)...

By: StackOverFlow - 7 days ago

# Related Posts

- Older News
- Why am I getting an arrayexceptionoverflow in this particular code? StackOverFlow (Yesterday) - I have something similar to this in Dijkstras algorithm but I’m getting no error in that. I’ve tried substituting different values for the integer max and other various things but...
- Package delivery on dense nondirected graph StackOverFlow (Yesterday) - So my last question was met more with a theoretical answer, so I have refined it specifically for the problem I'm looking at and provide what I believe to be...
- Derivative calculator and grapher StackOverFlow (2 days ago) - I have a final project in my Vectorial Calculus class about a calculator that can calculate the derivative of any function, graph it and all that stuff. It needs to...