Question

Using boost I need to go to a tree for sequence alignment, start at the leaves and go through it by to leaves. I have to make it multithreaded. How can I achieve this, again using boost threads?

I want to go through the tree and check if its a leaf. If so, align it and then wait for the others to be aligned, and then move to the next entry point. Something like this:

              R
            /   \
           /     \
          {a}    {b}
         /  \    /  \
       {c}  {d} {e} [f]
       /    /
     [h]  [j]

where f is a leaf; so are h and j. It needs to wait until there are no more leaves left before it moves into the next level, and so on. Any ideas? Thanks.

Answer 1

Using boost thread group and a deque, look it