I used this but only on my Test Box, With small data. I think no problem will be there if we will use indexes for both depth first search and breadth first search as per the requirement.
Thanks for the feedback. I appreciate it.
As a bit of sidebar, there's almost never a performance problem with small data. I have code that will build a million row Adjacency List and to truly answer the question, I guess I'm just going to have to test it and find out for sure. Your response also reminds me to test for resources used by indexes no matter what method is used. Thank you.
is pronounced ree-bar and is a Modenism for R
First step towards the paradigm shift of writing Set Based code: Stop thinking about what you want to do to a row... think, instead, of what you want to do to a column.
Although they tell us that they want it real bad, our primary goal is to ensure that we dont actually give it to them that way.
Although change is inevitable, change for the better is not.
Just because you can do something in PowerShell, doesnt mean you should. Helpful Links:
How to post code problemsHow to post performance problemsForum FAQs