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).

gmacro · Accepted Answer · 2018-03-24 15:16:47Z

1

Well, you should take a look at the docs: https://networkx.github.io/documentation/networkx-1.10/reference/generators.html#graph-generators.

answered Mar 24, 2018 at 15:16

gmacro

4274 silver badges6 bronze badges

Sign up to request clarification or add additional context in comments.

2 Comments

Arash Ashrafzadeh Over a year ago

I actually have checked it but it generates only some special graphs, not any random graph. Thanks

Bonlenfum Over a year ago

did you look at the section random graphs?

Collectives™ on Stack Overflow

How to generate different types of graphs in Python?

1 Answer 1

2 Comments

Your Answer

Hot Network Questions

Collectives™ on Stack Overflow

1 Answer 1

2 Comments

Your Answer

Sign up or log in

Post as a guest

Related