Class KNeighborhoodFilter<V,E>
java.lang.Object
edu.uci.ics.jung.algorithms.filters.KNeighborhoodFilter<V,E>
- All Implemented Interfaces:
com.google.common.base.Function<Graph<V,
,E>, Graph<V, E>> Filter<V,
,E> Function<Graph<V,
E>, Graph<V, E>>
A filter used to extract the k-neighborhood around one or more root node(s).
The k-neighborhood is defined as the subgraph induced by the set of
vertices that are k or fewer hops (unweighted shortest-path distance)
away from the root node.
-
Nested Class Summary
Nested ClassesModifier and TypeClassDescriptionstatic enum
The type of edge to follow for defining the neighborhood. -
Field Summary
Fields -
Constructor Summary
ConstructorsConstructorDescriptionKNeighborhoodFilter
(Set<V> rootNodes, int radiusK, KNeighborhoodFilter.EdgeType edgeType) Constructs a new instance of the filter.KNeighborhoodFilter
(V rootNode, int radiusK, KNeighborhoodFilter.EdgeType edgeType) Constructs a new instance of the filter. -
Method Summary
Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
Methods inherited from interface com.google.common.base.Function
equals
-
Field Details
-
rootNodes
-
radiusK
private int radiusK -
edgeType
-
-
Constructor Details
-
KNeighborhoodFilter
Constructs a new instance of the filter.- Parameters:
rootNodes
- the set of root nodesradiusK
- the neighborhood radius around the root setedgeType
- 0 for in/out edges, 1 for in-edges, 2 for out-edges
-
KNeighborhoodFilter
Constructs a new instance of the filter.- Parameters:
rootNode
- the root noderadiusK
- the neighborhood radius around the root setedgeType
- 0 for in/out edges, 1 for in-edges, 2 for out-edges
-
-
Method Details