Python Graph Library
--------------------------------------------------
Rise to the top 3% as a developer or hire one of them at Toptal: https://topt.al/25cXVn
--------------------------------------------------
Music by Eric Matyas
https://www.soundimage.org
Track title: Darkness Approaches Looping
--
Chapters
00:00 Python Graph Library
00:27 Accepted Answer Score 273
01:01 Answer 2 Score 120
01:24 Answer 3 Score 33
01:39 Answer 4 Score 12
01:51 Answer 5 Score 8
02:02 Thank you
--
Full question
https://stackoverflow.com/questions/6065...
--
Content licensed under CC BY-SA
https://meta.stackexchange.com/help/lice...
--
Tags
#python #graph
#avk47
Rise to the top 3% as a developer or hire one of them at Toptal: https://topt.al/25cXVn
--------------------------------------------------
Music by Eric Matyas
https://www.soundimage.org
Track title: Darkness Approaches Looping
--
Chapters
00:00 Python Graph Library
00:27 Accepted Answer Score 273
01:01 Answer 2 Score 120
01:24 Answer 3 Score 33
01:39 Answer 4 Score 12
01:51 Answer 5 Score 8
02:02 Thank you
--
Full question
https://stackoverflow.com/questions/6065...
--
Content licensed under CC BY-SA
https://meta.stackexchange.com/help/lice...
--
Tags
#python #graph
#avk47
ACCEPTED ANSWER
Score 274
There are two excellent choices:
and
I like NetworkX, but I read good things about igraph as well. I routinely use NetworkX with graphs with 1 million nodes with no problem (it's about double the overhead of a dict of size V + E)
If you want a feature comparison, see this from the Networkx-discuss list
ANSWER 2
Score 33
Have you looked at python-graph? I haven't used it myself, but the project page looks promising.
ANSWER 3
Score 12
Also, you might want to take a look at NetworkX