Package edu.uci.ics.jung.algorithms.filters


package edu.uci.ics.jung.algorithms.filters
Filtering mechanisms that produce subgraphs of an original graph. Currently includes:
  • Filter: an interface for graph filters
  • {Edge,Vertex}PredicateFilter: graph filters that return the induced subgraph according to the specified edge or vertex Predicate, respectively.
  • KNeighborhoodFilter: a filter that returns the subgraph induced by vertices within (unweighted) distance k of a specified vertex.
  • Class
    Description
    Transforms the input graph into one which contains only those edges that pass the specified Predicate.
    Filter<V,E>
    An interface for classes that return a subset of the input Graph as a Graph.
    Utility methods relating to filtering.
    A filter used to extract the k-neighborhood around one or more root node(s).
    The type of edge to follow for defining the neighborhood.
    Transforms the input graph into one which contains only those vertices that pass the specified Predicate.