[ODE] Iterative solution

[david@csworkbench.com]

Bodies that have been traversed are tagged, so no lookup is required to
prevent cycles.  O(n+c) is right.

David

> Gary R. Van Sickle wrote:
>>>Billy Zelsnack wrote:
>>>
>>>>Islands are still important because each island can converge in its
>>>> own number of steps.
>>>
>>>Quite so, excellent point.  It's just a shame that the island-finding
>>> is what, O(nlogn) itself?  But a cheap one.
>>
>> Should be O(n+e), n==number of bodies, e==number of constraints, no?
>> Isn't it just a series of simple DFS's of the graph formed by the
>> bodies and joints?
>
> I was being charitable and assuming that a magic hash lookup to
> detect cyclic graphs in the island-building from traversing joints would
> occur in log(n) time complexity for each node.
>
> --
> Adam D. Moss   . ,,^^   adam@gimp.org   http://www.foxbox.org/   co:3
> busting makes me feel good
> kthx bye
>
> _______________________________________________
> ODE mailing list
> ODE@q12.org
> http://q12.org/mailman/listinfo/ode