Graph data structure generation options and parametrization
Hello to everyone,
I'm looking for some suggestions for the following problem: generating a (undirected) graph instance for a NP-hard problem solver; the graph is implemented by an array of adjacency dynamic lists.
I've already wrote a simple routine to generate an instance given the number of nodes and the desired density, and it would be really nice if I could
-guarantee instance's connection without having to check it later
and ,more importantly,
- get more control on some of its topological characteristics, namely vertexes' max and min degrees, though the former is trivial to achieve.
thanks
HT
|