Re: [jgrapht-users] Bizarre issue with TopologicalOrderIterator

[<org...@io...>]

On 2014-12-03T22:18:50 -0800
John Sichi <js...@gm...> wrote:

> I don't see any dependency between Q and N in your code, so why do you
> think their relative order would be deterministic?

Hah, I guess that'd be the "question my own sanity" part - I had no idea
the algorithm even could be nondeterministic. Out of idle curiousity,
how does this happen? I didn't notice any concurrency or anything along
those lines.

I see that the lack of dependency between Q and N does allow that
returned order to make sense! I'll fix the test.

M