Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
I am designing a C++ data structure (for graphs) which is to be used by parallel code (using OpenMP).
Suppose I want to have a method which enables iteration over all elements (nodes). Of course, this iteration is going to be parallelized.
Is it possible to use an iterator for this purpose? How should an iterator look like that enables parallel access? Would you advise for or against using iterators in this case?
OpenMP parallel loops don’t play nicely with iterators. You’ll want to implement an indexing mechanism (
operator[]taking an integral argument) on your graph class.If you do want to use OpenMP 3.0 iterator support, make sure you have a random access iterator. Implementing it as an pointer to a node or edge is the simplest choice.