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

Packages that use edu.uci.ics.jung.graph.predicates

edu.uci.ics.jung.graph.filters
edu.uci.ics.jung.graph.predicates

Classes in edu.uci.ics.jung.graph.predicates used by edu.uci.ics.jung.graph.filters

EdgePredicate

VertexPredicate

Classes in edu.uci.ics.jung.graph.predicates used by edu.uci.ics.jung.graph.predicates

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.

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

VertexPredicate