Package edu.uci.ics.jung.graph.filters.impl

Class Summary
AlphabeticVertexFilter A small example filter that accepts vertices that are alphabetically past the input value.
DropSoloNodesFilter Accepts only nodes that have at least one edge--that is, nodes that are connected to one other node.
KNeighborhoodFilter A filter used to extract the k-neighborhood around one or more root node(s)
NumericDecorationFilter This simple filter accepts vertices if their UserData at the given key is over a threshold value.
WeightedEdgeGraphFilter This simple filter accepts Edges if their EdgeWeightLabeller turns out to be greater than the input value.