Re: [Axiom-developer] RE: dependency visualization with VCG

[root]

With respect to the notion of optimizing the domain we choose for
the bootstrap list:

Consider that we have, say 30 loops, each between 1 (some files
self-refer) and 20 long. If we write each loop as a list then the goal
is to choose domains out of the lists so we minimize the total number
of bootstrap domains. Clearly the best first choice is "the most
frequent" domain mentioned across all of the lists. We can then
eliminate all of those lists since we now have a bootstrap file. Next
we choose the most frequent domain from the remaining lists. This may
not be optimal but it would be a better algorithm than the one I used
which was to just choose any domain.

I'm sure there is a wonderful mathematical name for the bootstrap
list (e.g. the "kernel"?) but I haven't yet cast it into either
graph theory or any other theory yet.

Tim
address@hidden
address@hidden