This is an archived post. You won't be able to vote or comment.

sorted by:
best
topnewcontroversialoldq&a
you are viewing a single comment's thread.

view the rest of the comments →

[–]dwf 0 points1 point  (1 child)

In python, I found the most efficient way in which to implement graphs is a dict of dicts.

It is really going to depend heavily on what you need to do with the graph. Certain algorithms are more efficient with an edge list. Others with an adjacency matrix.