KPartiteGraphImpl (JPL-Commons 1.0 API)

Overview

Package

Class

Use

Tree

Deprecated

Index

Help

PREV CLASS NEXT CLASS

FRAMES NO FRAMES

SUMMARY: NESTED | FIELD | CONSTR | METHOD

DETAIL: FIELD | CONSTR | METHOD

org.expasy.jpl.commons.collection.graph
Class KPartiteGraphImpl<V,E>

java.lang.Object
  edu.uci.ics.jung.graph.AbstractGraph<V,E>
      edu.uci.ics.jung.graph.SparseMultigraph<V,E>
          org.expasy.jpl.commons.collection.graph.KPartiteGraphImpl<V,E>


Type Parameters:: V - vertex type.; E - edge type.

All Implemented Interfaces:: edu.uci.ics.jung.graph.Graph<V,E>, edu.uci.ics.jung.graph.Hypergraph<V,E>, edu.uci.ics.jung.graph.KPartiteGraph<V,E>, edu.uci.ics.jung.graph.MultiGraph<V,E>, Serializable, Registrable, Node

public final class KPartiteGraphImpl<V,E>
extends edu.uci.ics.jung.graph.SparseMultigraph<V,E>
implements edu.uci.ics.jung.graph.KPartiteGraph<V,E>, Node
extends edu.uci.ics.jung.graph.SparseMultigraph<V,E>
implements edu.uci.ics.jung.graph.KPartiteGraph<V,E>, Node

A simple implementation of KPartiteGraph.

Version:: 1.0
Author:: nikitin
See Also:: Serialized Form

Nested Class Summary
`static class`	`KPartiteGraphImpl.Collapser<V,E>`
`static class`	`KPartiteGraphImpl.PredicateImpl<T>`

Field Summary

Fields inherited from class edu.uci.ics.jung.graph.SparseMultigraph
`directedEdges, edges, vertices`

Constructor Summary
`KPartiteGraphImpl()`

Method Summary

boolean addEdge(E edge, V v1, V v2)

boolean addEdge(E edge, V v1, V v2, edu.uci.ics.jung.graph.util.EdgeType type)

boolean addVertex(V vertex)

int getEdgeCount(Collection<org.apache.commons.collections15.Predicate<V>> predicates)

int getEdgeCount(org.apache.commons.collections15.Predicate<V> predicate)

Collection<E> getEdges(Collection<org.apache.commons.collections15.Predicate<V>> predicates)

Collection<E> getEdges(org.apache.commons.collections15.Predicate<V> predicate)

String getId()

Collection<E> getIncidentEdges(V vertex, Collection<org.apache.commons.collections15.Predicate<V>> predicates)

Collection<E> getIncidentEdges(V vertex, org.apache.commons.collections15.Predicate<V> predicate)

Set<V> getNeighbors(V vertex, Collection<org.apache.commons.collections15.Predicate<V>> predicates)

Collection<V> getNeighbors(V vertex, org.apache.commons.collections15.Predicate<V> predicate)

int getPartitionIndex(org.apache.commons.collections15.Predicate<V> predicate)

int getPartitionIndex(V vertex)
Look for the partition of the given vertex.

Collection<org.apache.commons.collections15.Predicate<V>> getPartitions()

V getVertex(String id)

int getVertexCount(Collection<org.apache.commons.collections15.Predicate<V>> predicates)

int getVertexCount(org.apache.commons.collections15.Predicate<V> predicate)

Collection<V> getVertices(Collection<org.apache.commons.collections15.Predicate<V>> predicates)

Collection<V> getVertices(org.apache.commons.collections15.Predicate<V> predicate)

Set<String> getVerticesId()

static



<V,E> KPartiteGraphImpl<V,E>

newInstance(List<org.apache.commons.collections15.Predicate<V>> partitions,
                       boolean subsets)

boolean removeEdge(E edge)

boolean removeVertex(V vertex)

void setId(String id)

void setPartitions(Collection<org.apache.commons.collections15.Predicate<V>> predicates)

String toString()

Methods inherited from class edu.uci.ics.jung.graph.SparseMultigraph
`addEdge, containsEdge, containsVertex, findEdge, getDefaultEdgeType, getDest, getEdgeCount, getEdgeCount, getEdges, getEdges, getEdgeType, getEndpoints, getFactory, getIncidentEdges, getIncoming_internal, getInEdges, getNeighbors, getOutEdges, getOutgoing_internal, getPredecessors, getSource, getSuccessors, getVertexCount, getVertices, isDest, isSource`

Methods inherited from class edu.uci.ics.jung.graph.AbstractGraph
`addEdge, addEdge, addEdge, degree, findEdgeSet, getIncidentCount, getIncidentVertices, getNeighborCount, getOpposite, getPredecessorCount, getSuccessorCount, getValidatedEndpoints, inDegree, isIncident, isNeighbor, isPredecessor, isSuccessor, outDegree`

Methods inherited from class java.lang.Object
`clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait`

Methods inherited from interface edu.uci.ics.jung.graph.Graph
`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, containsEdge, containsVertex, degree, findEdge, findEdgeSet, getDefaultEdgeType, getEdgeCount, getEdgeCount, getEdges, getEdges, getEdgeType, getIncidentCount, getIncidentEdges, getIncidentVertices, getNeighborCount, getNeighbors, getVertexCount, getVertices, isIncident, isNeighbor`

Constructor Detail