Efficiently finding the shortest path in large graphs

Posted by Björn Lindqvist on Stack Overflow See other posts from Stack Overflow or by Björn Lindqvist
Published on 2010-06-14T15:50:10Z Indexed on 2010/06/14 15:52 UTC
Read the original article Hit count: 320

Filed under:
|
|
|
|

I'm looking to find a way to in real-time find the shortest path between nodes in a huge graph. It has hundreds of thousands of vertices and millions of edges. I know this question has been asked before and I guess the answer is to use a breadth-first search, but I'm more interested in to know what software you can use to implement it. For example, it would be totally perfect if it already exist a library (with python bindings!) for performing bfs in undirected graphs.

© Stack Overflow or respective owner

Related posts about python

Related posts about graphs