I’ve posted a project providing a visual step-through explanation of Dijkstra’s shortest-path algorithm implemented on a randomly-generated digraph, as well as a short report on the algorithm and my project, available for download on the “projects” page.
Monthly Archives: July 2014
Multithreaded Parallel Breadth-First Search: An implementation in C++11
Multithreading and Parallel Breadth-First Search: An implementation in C++11
So, if you read the accompanying lab report, you’ll see this was an attempt at using the C++11 multithreading library (essentially the same as the Boost multithreading library) to implement a parallel breadth-first search algorithm. The results weren’t spectacular, but I don’t feel too bad; of the two computer scientists who developed the more successful approach, one of them literally wrote the book on algorithms.
Anyway, if this is helpful to anyone, please feel free to add to, change, or take away from my work here. I’d really appreciate any feedback, though. Thanks!