Package edu.uci.ics.jung.graph
Interface KPartiteGraph<V,E>
- All Superinterfaces:
Graph<V,
,E> Hypergraph<V,
E>
An interface for graphs whose vertices are each members of one of 2 or more
disjoint sets (partitions), and whose edges connect only vertices in distinct
partitions.
-
Method Summary
Modifier and TypeMethodDescriptionCollection
<com.google.common.base.Predicate<V>> Returns the set ofPredicate
instances which define this graph's partitions.getVertices
(com.google.common.base.Predicate<V> partition) Returns all vertices which satisfy the specifiedpartition
predicate.Methods inherited from interface edu.uci.ics.jung.graph.Graph
addEdge, addEdge, getDest, getEndpoints, getInEdges, getOpposite, getOutEdges, getPredecessorCount, getPredecessors, getSource, getSuccessorCount, getSuccessors, inDegree, isDest, isPredecessor, isSource, isSuccessor, outDegree
Methods inherited from interface edu.uci.ics.jung.graph.Hypergraph
addEdge, addEdge, addVertex, containsEdge, containsVertex, degree, findEdge, findEdgeSet, getDefaultEdgeType, getEdgeCount, getEdgeCount, getEdges, getEdges, getEdgeType, getIncidentCount, getIncidentEdges, getIncidentVertices, getNeighborCount, getNeighbors, getVertexCount, getVertices, isIncident, isNeighbor, removeEdge, removeVertex
-
Method Details
-
getVertices
Returns all vertices which satisfy the specifiedpartition
predicate.- Parameters:
partition
-Predicate
which defines a partition- Returns:
- all vertices satisfying
partition
-
getPartitions
Collection<com.google.common.base.Predicate<V>> getPartitions()Returns the set ofPredicate
instances which define this graph's partitions.- Returns:
- the set of
Predicate
instances which define this graph's partitions
-