Dijkstra’s shortest path in C++ using Intel® Parallel Studio XE 2015 Composer Edition

Dijkstra’s shortest path in C++ using Intel® Parallel Studio XE 2015 Composer Edition

This three minute video explains how to build and run a C++ sample application which demonstrates the benefit of using OpenMP* work sharing in conjunction with Intel® Cilk™ Plus array notation to speed up the computation of Dijkstra's shortest path algorithm using Intel® Composer XE 2015. This video is a companion to the TestDriveShortestPath.zip sample code.

Download code sample

Download Video

852X460 (11.61 MB)

For more complete information about compiler optimizations, see our Optimization Notice.