[GRASS-dev] Re: [GRASS-user] v.dissolve and r.cost problems

[Paolo Cavallini]

Markus Metz ha scritto:
> Could it be that the binary tree implementation in r.cost is not
> balanced? If yes, the search tree may degenerate on smooth surfaces
> towards a linked list, search time going from O(log n) to O(n). BTW,
> there are now three different generic balanced binary search tree
> implementations in the vector libs, plus sorted heaps. Just an idea.

Tested on two different machines, (ubuntu+debian) 3 diff surfaces,
always the same result. It seems something more structural.
:(
But, is r.cost working for somebody else?
-- 
Paolo Cavallini: http://faunalia.it/pc