Re: [jgrapht-users] Non-determinstic getSpanningTreeEdge call
Brought to you by:
barak_naveh,
perfecthash
From: Idan M. <ida...@gm...> - 2009-02-16 08:58:21
|
I'm trying to reproduce the behaviour in a simple graph and check the theory. Sounds like that is the problem. Thanks, Idan. On Mon, Feb 16, 2009 at 10:22 AM, John V. Sichi <js...@gm...> wrote: > Idan Miller wrote: > >> The graph building is done by getting the vertices and edges from a >> database and creating them. >> The vertices and edges may come in a different order each time because the >> select query is not sorted. >> Could the order difference of adding the edges may cause this to happen? >> >> If I add edge A to the graph than edge B, will I get A and then B in the >> iterator, and if I put B than A will that change to B and A in the iterator >> respectively? >> >> If so, that may be it. >> > > Yes, sounds like that is your problem. You may be able to solve it by > adding an ORDER BY to your database queries. > > JVS > |