[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: [igraph] Chained operations

From: Gábor Csárdi
Subject: Re: [igraph] Chained operations
Date: Thu, 20 Aug 2009 11:37:58 +0200

The idea is nice, but it makes things quite difficult, so I don't
think that we will have this feature.
Can you give me two or three specific examples when this would be
useful? If there are some important use cases, then I will think about


On Thu, Aug 20, 2009 at 12:13 AM, Chris Wj<address@hidden> wrote:
> What do you guys think about the idea of chaining operations that leverage
> common calculations. Say, for example, that you had 2 algorithms that
> required shortest paths to be calculated before continuing, if you run them
> both from scratch, they both calculate shortest paths first, then thier own
> calculations. So shortest paths gets computed twice (and that is an
> expensive calculation!). So what if you could either chain operations, or
> hold on to the intermediate calculation until the graph structure actually
> changed ("dirty bit").
> Also, what algorithms are similar enough to one another that we could avoid
> duplicate work by performing them simultaneously?
> _______________________________________________
> igraph-help mailing list
> address@hidden
> http://lists.nongnu.org/mailman/listinfo/igraph-help

Gabor Csardi <address@hidden>     UNIL DGM

reply via email to

[Prev in Thread] Current Thread [Next in Thread]