On Thu, Sep 7, 2017 at 12:24 AM, Luc Van Oostenryck <luc.vanoostenryck@xxxxxxxxx> wrote: > On Thu, Sep 7, 2017 at 6:02 AM, Christopher Li <sparse@xxxxxxxxxxx> wrote: >> On Wed, Sep 6, 2017 at 11:46 PM, Luc Van Oostenryck >> <luc.vanoostenryck@xxxxxxxxx> wrote: >> >>>> For reducible graph that algorithm converge in constant iteration. My statement is regarding *reducible* graph. >>> >>> Where the 'constant' is a function of the loop complexity (maximum >>> nesting level) ... >> >> I think we are talking different things. > > Since you're talking performance and complexity, I suggest that you read > carefully the section "Complexity Analysis" of the article and look where > it's written 'd(G)' and 'loop connectedness'. I assume you are talking page 7. The 'd(G)' and the "loop contentedness" is actually referring to the *irreducible" graph. The Figure 4 is classic *irreducible* graph. That is why I feel we are talking about different things. Chris -- To unsubscribe from this list: send the line "unsubscribe linux-sparse" in the body of a message to majordomo@xxxxxxxxxxxxxxx More majordomo info at http://vger.kernel.org/majordomo-info.html
