Before heading off to bead, just wanted to verify that your final message is that the changes can stay after all :-)
I have not run any performance comparisons between this method and yours but it would not surprise me if yours was faster. As I mentioned in the code, there will be some overhead for maintaining the path into the graph. But the cost should be fairly small given how often the algorithm is called and the difference between the following messages makes the slight cost more than worth it IMO:
CyclicDependencyException:
and
CyclicDependencyException: Component1 -> Component2 -> Component3 -> Component2
You know the code much better than I do obviously so let me know if there are any changes that you think should be made.
Cheers, Leif
--------------------------------------------------------------------- To unsubscribe, e-mail: [EMAIL PROTECTED] For additional commands, e-mail: [EMAIL PROTECTED]
