[jplewicke]

There's a component that has some weighted shortest-path algorithms: http://wiki.neo4j.org/content/Graph-algo

Please let me know if you find anything that can handle negative edge weights well while efficiently tracking shortest paths. I've found some papers with efficient implementations for frequently updated edge weights, but haven't found anything implemented or accessible.