It's all about the answers!

Ask a question

RTC BIRT Report: How to recursively traverse all the work items with the "Depend On" linkage?

Clement Liu (1.5k54249) | asked May 01 '14, 12:09 p.m.
I can use embedded dataset but the depth of the linkage tree has to be known at the build time. I'm wondering if there is any way to dynamically traverse all the work items recursively.  

Here is an example:

         depends on 
                      depends on 

How do I build a BIRT report to dynamically traverse deep down to the bottom of the tree and bring back all the work items? 


Accepted answer

permanent link
Bill Taylor (1441533) | answered May 01 '14, 3:34 p.m.
You can't recurse indefinitely, but what you can do is pick an arbitrary maximum depth, create a table based on a scripted dataset that loop that number of times and then add to the table elements linked to datasets to retrieve each work item and then get the itemId of its related work item.
Clement Liu selected this answer as the correct answer

Ajay Mallikarjunaiah commented Jul 30 '14, 7:30 a.m.

Hello Clement Liu,

Could you please explain a bit more how you achieved the above requirement.
Thank you in advance.

Your answer

Register or to post your answer.