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

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
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).
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