modified the last step of the dijkstra graph search to use mini dijkstra traversals instead of the specialized depth 1 traversals
modified the last step of the dijkstra graph search to use mini dijkstra traversals instead of the specialized depth 1 traversals

academia-edu/neo_fast_shortest_paths