[SciPy-Dev] Graph shortest path

[Jacob VanderPlas]

Hello,
A while ago in scikit-learn we implemented an efficient cython graph 
shortest-path search using both Dijkstra's algorithm and the 
Floyd-Warshall algorithm with Fibonacci heaps.  Currently this is 
well-hidden in the scikit-learn utils:
https://github.com/scikit-learn/scikit-learn/blob/master/sklearn/utils/graph_shortest_path.pyx
This is the kind of basic algorithm that I think belongs in scipy rather 
than scikit-learn.  I know that some developers have been thinking about 
graph tools for scipy: are there ideas about whether/where the shortest 
path search would fit in scipy?
Thanks
  Jake