Leif Mortenson wrote:
So far, everything seems to now be working and I am now able to get my application up and running.
I fear that the changes you did would make things a bit less efficient. I actually used to have two different methods for testing if a "graph" had a cycle, and since reduced it into one. I did catch a couple of minor issues in the process, but I would like to keep the topological sort using the same algorithm if at all possible--and fix my implementation.
Ok. I am on crack, and I defer to your greater wisdom ;P
I took a closer look at the implementation, and it is much easier to understand than what I had originally wrote. What I originally wrote was from psuedocode that I found on the web after doing a Google search on DAGs.
While theorhetically the way I implemented was a little more "pure", this is just as fast and easier to understand.
--------------------------------------------------------------------- To unsubscribe, e-mail: [EMAIL PROTECTED] For additional commands, e-mail: [EMAIL PROTECTED]
