edu.uci.ics.jung.graph

Interface KPartiteGraph<V,E>

All Superinterfaces:

Graph<V,E>, Hypergraph<V,E>

public interface KPartiteGraph<V,E>
extends Graph<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 Type	Method and Description
java.util.Collection<com.google.common.base.Predicate<V>>	getPartitions() Returns the set of Predicate instances which define this graph's partitions.
java.util.Collection<V>	getVertices(com.google.common.base.Predicate<V> partition) Returns all vertices which satisfy the specified partition 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 Detail

getVertices

java.util.Collection<V> getVertices(com.google.common.base.Predicate<V> partition)

Returns all vertices which satisfy the specified partition predicate.

Parameters:

partition - Predicate which defines a partition

Returns:

all vertices satisfying partition

getPartitions

java.util.Collection<com.google.common.base.Predicate<V>> getPartitions()

Returns the set of Predicate instances which define this graph's partitions.

Returns:

the set of Predicate instances which define this graph's partitions