Hi! Thanks for graph-tools, it looks like a fab project!
I am toying around with a particular class of graphs for which I wrote a
subclass of `graph_tools.Graph`. It should be great to be able to use
`GraphView` for filtering (I'm implementing a divide-and-conquer
algorithm and want to recur on su
Hi Tiago, thanks for your prompt reply.
Quoting Tiago de Paula Peixoto (2016-09-21 10:35:39)
> On 21.09.2016 10:28, Patrick Totzke wrote:
> > I am toying around with a particular class of graphs for which I wrote a
> > subclass of `graph_tools.Graph`. It should be great to
Quoting Tiago de Paula Peixoto (2016-09-21 17:45:32)
> On 21.09.2016 14:53, Patrick Totzke wrote:
> >>> Is there a better way to filter my graphs than writing a custom
> >>> `GraphView` subclass for it?
> >>
> >> You can just use the set_edge/vertex_f
Hi again,
I'm using boolean PropertyMaps to represent subsets of graph vertices
in combination with `GraphView(g, vfilt=Mask).vertices()` for iteration.
I often need the complement of such sets and would like to complement
a mask using `numpy.invert`, for efficiency:
"""
Mask = graph.new_vertex_
Quoting Tiago de Paula Peixoto (2016-09-26 13:02:03)
> On 26.09.2016 11:06, Patrick Totzke wrote:
> >
> > Hi again,
> >
> > I'm using boolean PropertyMaps to represent subsets of graph vertices
> > in combination with `GraphView(g, vfilt=Mask).vertices(
