Optimize a Classic Graph Algorithm Using Intel C++ Compiler
- Overview
This is a computer translation of the original content. It is provided for general information only and should not be relied upon as complete or accurate.
Video tutorial illustrating increased performance of the infamous Dijkstra’s Shortest Path Graph Algorithm using the Intel® C++ Compiler. In the tutorial, performance is shown in four ways: serialized, with vectorization, threaded with OpenMP* and with both vectorization and OpenMP. End result is to showcase the performance benefit of each way using the Intel® C++ Compiler.
