Example that uses parallel_do to do parallel preorder traversal of a sparse graph.
Each vertex in the graph is called a "cell".
Each cell has a value.
The value is a matrix.
Some of the cells have operators
that compute the cell's value, using other cell's values as input.
A cell that uses the value of cell x is called a successor of x.
The algorithm works as follows.
For the most up to date system requirements, see the release notes.
For information about the minimum supported version of IDE, see release notes.
General build directions can be found here.
Intel and the Intel logo are trademarks of Intel Corporation in the U.S. and/or other countries.
* Other names and brands may be claimed as the property of others.
© 2019, Intel Corporation