Mark H Weaver <m...@netris.org> skribis: > I think the graph we need to consider is one that contains one vertex > per module, and an directed edge from module A to B if and only if > loading module A requires looking up a binding from module B. > > Does that sound right to you?
Yes, exactly. Ludo’.
