Does anyone have a pointer to a resource or, even better, a tip to provide on how to efficiently generate a very large matrix representing a connected graph.
Graph can be randomly created although I would ideally generate a graph of desired size and topology similar to what one can do with JGraphT.
My general intent is to create a very large graph representation (billions of nodes and edges) in parallel by first generating an adjacency matrix to ensure connectedness and then create a representation (RDF, etc) in parallel.
Any further suggestions or alternative approaches are welcome.