On 18 Nov 2000, Nix wrote:
> Alexander Viro <viro@math.psu.edu> writes:
>
> > If every way from foo to target goes through the source rename(source,target)
> > _will_ make the graph disconnected. Checking that for generic DAG is a hell.
>
> Why do you say this? Algorithms for cycle detection are comparatively
> computationally expensive, to be sure, but they are well understood. In
s/computationally/& and IO/. If we are thinking about the same algorithm -
good luck doing that if your data structures are on disk. Think of
reference locality in that animal. Try to estimate the amount of IO and
fun with seeks. It's nice when you have your data in-core, but when it's
on-disk and you want reasonable locality of references for normal uses...
-
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo@vger.kernel.org
Please read the FAQ at http://www.tux.org/lkml/
This archive was generated by hypermail 2b29 : Thu Nov 23 2000 - 21:00:14 EST