(There is #24004 with positive_review, so I code changes should be thinked
after next beta.)
On Wed, 11 Oct 2017, Robert Miller wrote:
4) When is augment='edges' usefull? Is
One reason it is useful:
You can use the argument "property" to restrict to a subclass of graphs. This
argument takes a function and
filters the output by testing against this property. If this property is
preserved under vertex deletion, then
using augment='vertices' will give you all graphs satisfying the property.
Similarly for edges. If the property
is not preserved as described, then you may be missing some.
Yes, that's why I asked about properties like that.
But I already found an example where augment='edges' could be used:
property=lambda g: g.size() < n, where n is small number; it will work
with augment='vertices', but is slower.
Also, if you use augment="edges" you get graphs on exactly N vertices,
and if you use augment="vertices" you get graphs on ≤ N vertices.
Yes, just as I wrote in message starting this thread. And it seems quite
unlogical.
For any particular family of graphs it is likely there are faster ways
to do it - for example we have a method of generating iso-classes of
trees in constant time per tree. This is meant to be a useful
general-purpose generator.
True.
--
Jori Mäntysalo
