Updated new dijkstra implementation to produce the same output as the other versions.
adding avro reader
test
conflict resolve
Added the exhaustive version of the BC algorithm working on the adjacency list format. Minor changes to shortest-path output formatting.
Priority map should be defined to have values of type double.
Changed the sssp implementation to use avro files in addtion to text files for adjacency list format.
make it possible to read old bin file where bytes were flipped
Merge branch 'master' of github.com:stanford-ppl/Green-Marl
unordered map
adding -std option to commmon.mk for unordered map
Modified output to report no shortest path found in a consistent way.
fixing bug in BFS single-threaded
Updated output to be consistent with other implementations of sssp.
Merge branch 'master' of http://github.com/stanford-ppl/Green-Marl
save child fix
Merge branch 'master' of github.com:stanford-ppl/Green-Marl
The BC version using adjacency list now takes a configuration file as parameter that contains information about nodes whose BC is to be printed.
Fixed (again) the problem with priority map being defined to take int values rather than double values.
Added an additional optimization to sssp.