Package edu.uci.ics.jung.graph.predicates

A Predicate tests whether an Object satisfies a specific implementation-defined property.

See:
          Description

Interface Summary
UncopyablePredicate A tagging interface for predicates that should not be copied along with their graph.
 

Class Summary
CliqueGraphPredicate Returns true if this graph is a clique (that is, if each vertex in the graph is a neighbor of each other vertex; also known as a complete graph).
ConnectedGraphPredicate  
ContainsUserDataKeyVertexPredicate Returns true iff the vertex contains the specified user data key.
EdgePredicate  
GPredicate  
GraphPredicate  
IsolatedVertexPredicate A predicate which tests to see whether a specified vertex has any neighbors.
KPartiteEdgePredicate An edge predicate that passes Edges whose endpoints satisfy distinct elements of the Predicate collection passed in as a parameter to the constructor.
NotInGraphEdgePredicate A predicate that tests to see whether a specified edge is currently part of a graph.
NotInGraphVertexPredicate A predicate that tests to see whether a specified vertex is currently part of a graph.
ParallelEdgePredicate A predicate that checks to see whether the specified edge is parallel to any other edge.
ReciprocatedDirectedEdgePredicate Returns true if and only if this edge is a DirectedEdge that has an antiparallel DirectedEdge in this graph.
SelfLoopEdgePredicate A predicate that checks to see whether a specified edge is a self-loop.
SimpleEdgePredicate A predicate that tests to see whether a specified edge is "simple" (neither parallel to any edge nor a self-loop).
SinkVertexPredicate Evaluates to true if and only if the specified vertex is a sink, i.e., has no outgoing directed edges.
SourceVertexPredicate Evaluates to true if and only if the specified vertex is a source, i.e., has no incoming directed edges.
ThresholdPredicate A predicate which passes Numbers whose value satisfies a threshold requirement.
TreePredicate  
UserDatumEdgePredicate A predicate that checks to see whether an edge's user data repository contains the constructor-specified (key,datum) pair.
UserDatumVertexPredicate A predicate that checks to see whether a vertex's user data repository contains the constructor-specified (key,datum) pair.
VertexPredicate  
 

Package edu.uci.ics.jung.graph.predicates Description

A Predicate tests whether an Object satisfies a specific implementation-defined property. Predicates may be logically combined using such Jakarta-defined predicates as AndPredicate (which returns true if all input predicates return true). JUNG uses Predicates (found in the graph.predicates package) for the following tasks:

Note: Some predicates are unsuitable for use as constraints (and some predicates are only suitable for use as constraints). We have tried to make these distinctions clear in the documentation for each predicate. Users are advised to read the documentation for a predicate before using it. Some general rules for which predicates are appropriate in different circumstances:

JUNG Predicates that do not take constructor arguments are accessed via a static getInstance call; other Predicates are created with the usual constructor call.

For more information on Predicates and their use, see the commons-collections website.