How to generate different types of graphs in Python?

Question

I would like to generate many different connected, undirected graphs in Python. And by different, I mean sparse, dense, complete, acyclic, hamiltonian, ... graphs with different amounts for the number of nodes and possibly edges.

I have already worked with networkX and numpy libraries to generate graphs given an adjacency matrix, but this method is not useful for generating large graphs.

My purpose is to run some algorithms on many graphs and compare those algorithms to see which work better on what type of graphs (as an example, to say algorithm X works better than others on dense, acyclic graphs with more than 500 nodes).

Answer 1

好了，您应该看看以下文档： https : //networkx.github.io/documentation/networkx-1.10/reference/generators.html#graph-generators 。