title: Efficiently finding the shortest path in large graphs
body: <p>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.</p>