Improved the performance of the aggregate phase in the hybrid BFS stepwise algorithm by reversing the way the final data is collected to allow for sequential writes and random reads instead of random writes and sequential reads.
Further optimized the aggregate phase of the hybrid BFS stepwise algorithm. The new optimization aims at improving access locality while aggregating the results by permuting the local cost array
Enabled dynamic switching between top-down and bottom-up in the hybrid stepwise BFS algorithm.
Replaced all uses of cost in the hybrid stepwise BFS algorithm with either the frontier or the visited bitmap
Refactored the scatter function in the hybrid BFS stepwise algorithm.
Replaced all uses of cost in the hybrid stepwise BFS algorithm with either the frontier or the visited bitmap
Added the BFS stepwise algorithm to the benchmark.
Added an inital version of the Graph500 BFS-stepwise algorithm.