[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Thu, 21 May 2009 11:44:19 +0200
Hi all list!
Let's suppose I have a graph g, and a subgraph of g, let's call it h.
I'd like to build the graph that is defined of all the vertices in g
that are not in h.
Edges are kept the same as in g if both the endvertices survive, or
are deleted if at least one of the endvertices is killed.
How do it efficiently in igraph?
thanks in advance as always,
restituiremo il riso ai salici
- [igraph] subtraction?,