public class FilterUtils
extends java.lang.Object
Constructor and Description |
---|
FilterUtils() |
Modifier and Type | Method and Description |
---|---|
static <V,E,G extends edu.uci.ics.jung.graph.Hypergraph<V,E>> |
createAllInducedSubgraphs(java.util.Collection<? extends java.util.Collection<V>> vertex_collections,
G graph)
Creates the induced subgraphs of
graph associated with each
element of vertex_collections . |
static <V,E,G extends edu.uci.ics.jung.graph.Hypergraph<V,E>> |
createInducedSubgraph(java.util.Collection<V> vertices,
G graph)
Creates the induced subgraph from
graph whose vertex set
is equal to vertices . |
public static <V,E,G extends edu.uci.ics.jung.graph.Hypergraph<V,E>> G createInducedSubgraph(java.util.Collection<V> vertices, G graph)
graph
whose vertex set
is equal to vertices
. The graph returned has
vertices
as its vertex set, and includes all edges from
graph
which are incident only to elements of
vertices
.V
- the vertex typeE
- the edge typevertices
- the subset of graph
's vertices around
which the subgraph is to be constructedgraph
- the graph whose subgraph is to be constructedvertices
java.lang.IllegalArgumentException
- if any vertex in
vertices
is not in graph
public static <V,E,G extends edu.uci.ics.jung.graph.Hypergraph<V,E>> java.util.Collection<G> createAllInducedSubgraphs(java.util.Collection<? extends java.util.Collection<V>> vertex_collections, G graph)
graph
associated with each
element of vertex_collections
.
Note that these vertex collections need not be disjoint.V
- the vertex typeE
- the edge typevertex_collections
- the collections of vertex collections to be
used to induce the subgraphsgraph
- the graph whose subgraphs are to be createdgraph
associated with each
element of vertex_collections