- Calculate the shortest path distance from a single vertex in the graph to all other vertices.
The goal is to study the performance of algorithms for SSSP using parallel computation in c++ using SYCL. The first attempt will be to translate the Delta stepping algorithm found in wiki
"Geometric diagrams are to geometers what board and pieces are to chessmasters: visual aids, helpful but not indispensable."
— Richard J. Trudeau, Introduction to Graph Theory