R.E. Boss wrote: > I made a merge of comp and mcsg > I am very pleased to hear this.
> However I realized that it is rather inappropriate to take into account > points which are not mentioned in the edges. This too: I have been using a technique to get around it that is much cruder. > > But recently I discovered another approach which appears to be much faster > even: I will try this out shortly. I have two concrete problems where my holdup is calculating the size of components in a large number of graphs. I do not need the exact vertices, but I eliminate cases based on component sizes. Since your previous method did not work fast enough for me, I have been eliminating some cases using gross ad hoc criteria, but it would be much more elegant to just calculate the component sizes. Best wishes, John ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
