GraphDecorator

java.lang.Object
- edu.uci.ics.jung.graph.GraphDecorator<V,E>

All Implemented Interfaces:

Graph<V,E>, Hypergraph<V,E>, java.io.Serializable

Direct Known Subclasses:

DelegateForest, DelegateTree, ObservableGraph
```
public class GraphDecorator<V,E>
extends java.lang.Object
implements Graph<V,E>, java.io.Serializable
```
An implementation of Graph that delegates its method calls to a constructor-specified Graph instance. This is useful for adding additional behavior (such as synchronization or unmodifiability) to an existing instance.

See Also:

Serialized Form

Field Summary

Fields
Modifier and Type Field and Description

protected Graph<V,E> delegate

Fields
Modifier and Type	Field and Description
`protected Graph<V,E>`	`delegate`

Constructor Summary

Constructors
Constructor and Description

GraphDecorator(Graph<V,E> delegate)
Creates a new instance based on the provided delegate.

Constructors
Constructor and Description
`GraphDecorator(Graph<V,E> delegate)` Creates a new instance based on the provided `delegate`.

Method Summary

All Methods Instance Methods Concrete Methods
Modifier and Type	Method and Description
`boolean`	`addEdge(E e, V v1, V v2)` Adds edge `e` to this graph such that it connects vertex `v1` to `v2`.
`boolean`	`addEdge(E e, V v1, V v2, EdgeType edgeType)` Adds edge `e` to this graph such that it connects vertex `v1` to `v2`.
`boolean`	`addEdgeWithVertices(E edge, java.util.Collection<? extends V> vertices)` Adds `edge` to this graph.
`boolean`	`addEdgeWithVertices(E edge, java.util.Collection<? extends V> vertices, EdgeType edgeType)` Adds `edge` to this graph with type `edge_type`.
`boolean`	`addVertex(V vertex)` Adds `vertex` to this graph.
`boolean`	`containsEdge(E edge)` Returns true if this graph's edge collection contains `edge`.
`boolean`	`containsVertex(V vertex)` Returns true if this graph's vertex collection contains `vertex`.
`int`	`degree(V vertex)` Returns the number of edges incident to `vertex`.
`E`	`findEdge(V v1, V v2)` Returns an edge that connects this vertex to `v`.
`java.util.Collection<E>`	`findEdgeSet(V v1, V v2)` Returns all edges that connects this vertex to `v`.
`EdgeType`	`getDefaultEdgeType()` Returns the default edge type for this graph.
`V`	`getDest(E directedEdge)` If `directed_edge` is a directed edge in this graph, returns the destination; otherwise returns `null`.
`int`	`getEdgeCount()` Returns the number of edges in this graph.
`int`	`getEdgeCount(EdgeType edgeType)` Returns the number of edges of type `edge_type` in this graph.
`java.util.Collection<E>`	`getEdges(EdgeType edgeType)` Returns the collection of edges in this graph which are of type `edge_type`.
`java.util.Collection<E>`	`getEdgesView()` Returns a view of all edges in this graph.
`EdgeType`	`getEdgeType(E edge)` Returns the edge type of `edge` in this graph.
`Pair<V>`	`getEndpoints(E edge)` Returns the endpoints of `edge` as a `Pair`.
`int`	`getIncidentCount(E edge)` Returns the number of vertices that are incident to `edge`.
`java.util.Collection<E>`	`getIncidentEdges(V vertex)` Returns the collection of edges in this graph which are connected to `vertex`.
`java.util.Collection<V>`	`getIncidentVertices(E edge)` Returns the collection of vertices in this graph which are connected to `edge`.
`java.util.Collection<E>`	`getInEdges(V vertex)` Returns a `Collection` view of the incoming edges incident to `vertex` in this graph.
`int`	`getNeighborCount(V vertex)` Returns the number of vertices that are adjacent to `vertex` (that is, the number of vertices that are incident to edges in `vertex`'s incident edge set).
`java.util.Collection<V>`	`getNeighbors(V vertex)` Returns the collection of vertices which are connected to `vertex` via any edges in this graph.
`V`	`getOpposite(V vertex, E edge)` Returns the vertex at the other end of `edge` from `vertex`.
`java.util.Collection<E>`	`getOutEdges(V vertex)` Returns a `Collection` view of the outgoing edges incident to `vertex` in this graph.
`int`	`getPredecessorCount(V vertex)` Returns the number of predecessors that `vertex` has in this graph.
`java.util.Collection<V>`	`getPredecessors(V vertex)` Returns a `Collection` view of the predecessors of `vertex` in this graph.
`V`	`getSource(E directedEdge)` If `directed_edge` is a directed edge in this graph, returns the source; otherwise returns `null`.
`int`	`getSuccessorCount(V vertex)` Returns the number of successors that `vertex` has in this graph.
`java.util.Collection<V>`	`getSuccessors(V vertex)` Returns a `Collection` view of the successors of `vertex` in this graph.
`int`	`getVertexCount()` Returns the number of vertices in this graph.
`java.util.Collection<V>`	`getVerticesView()` Returns a view of all vertices in this graph.
`int`	`inDegree(V vertex)` Returns the number of incoming edges incident to `vertex`.
`boolean`	`isDest(V vertex, E edge)` Returns `true` if `vertex` is the destination of `edge`.
`boolean`	`isIncident(V vertex, E edge)` Returns `true` if `vertex` and `edge` are incident to each other.
`boolean`	`isNeighbor(V v1, V v2)` Returns `true` if `v1` and `v2` share an incident edge.
`boolean`	`isPredecessor(V v1, V v2)` Returns `true` if `v1` is a predecessor of `v2` in this graph.
`boolean`	`isSource(V vertex, E edge)` Returns `true` if `vertex` is the source of `edge`.
`boolean`	`isSuccessor(V v1, V v2)` Returns `true` if `v1` is a successor of `v2` in this graph.
`int`	`outDegree(V vertex)` Returns the number of outgoing edges incident to `vertex`.
`boolean`	`removeEdge(E edge)` Removes `edge` from this graph.
`boolean`	`removeVertex(V vertex)` Removes `vertex` from this graph.

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

- Field Detail
  - delegate
```
protected Graph<V,E> delegate
```
- Constructor Detail
  - GraphDecorator
```
public GraphDecorator(Graph<V,E> delegate)
```
    Creates a new instance based on the provided delegate.
    
    Parameters:
    
    delegate -
- Method Detail
  - addEdgeWithVertices
```
public boolean addEdgeWithVertices(E edge,
                                   java.util.Collection<? extends V> vertices)
```
    Description copied from interface: Hypergraph
    Adds edge to this graph. Fails under the following circumstances:
    - edge is already an element of the graph
    - either edge or vertices is null
    - vertices has the wrong number of vertices for the graph type
    - vertices are already connected by another edge in this graph, and this graph does not accept parallel edges
    Specified by:
    
    addEdgeWithVertices in interface Hypergraph<V,E>
    
    Parameters:
    
    edge - the edge
    
    vertices - the vertices
    
    Returns:
    
    true if the add is successful, and false otherwise
  - addEdgeWithVertices
```
public boolean addEdgeWithVertices(E edge,
                                   java.util.Collection<? extends V> vertices,
                                   EdgeType edgeType)
```
    Description copied from interface: Hypergraph
    Adds edge to this graph with type edge_type. Fails under the following circumstances:
    - edge is already an element of the graph
    - either edge or vertices is null
    - vertices has the wrong number of vertices for the graph type
    - vertices are already connected by another edge in this graph, and this graph does not accept parallel edges
    - edgeType is not legal for this graph
    Specified by:
    
    addEdgeWithVertices in interface Hypergraph<V,E>
    
    Parameters:
    
    edge - the edge
    
    vertices - the vertices
    
    edgeType - the edge type
    
    Returns:
    
    true if the add is successful, and false otherwise
  - addEdge
```
public boolean addEdge(E e,
                       V v1,
                       V v2,
                       EdgeType edgeType)
```
    Description copied from interface: Graph
    
    Adds edge e to this graph such that it connects vertex v1 to v2. Equivalent to addEdge(e, new Pair(v1, v2)). If this graph does not contain v1, v2, or both, implementations may choose to either silently add the vertices to the graph or throw an IllegalArgumentException. If edgeType is not legal for this graph, this method will throw IllegalArgumentException. See Hypergraph.addEdge() for a listing of possible reasons for failure.
    
    Specified by:
    
    addEdge in interface Graph<V,E>
    
    Parameters:
    
    e - the edge to be added
    
    v1 - the first vertex to be connected
    
    v2 - the second vertex to be connected
    
    edgeType - the type to be assigned to the edge
    
    Returns:
    
    true if the add is successful, false otherwise
  - addEdge
```
public boolean addEdge(E e,
                       V v1,
                       V v2)
```
    Description copied from interface: Graph
    
    Adds edge e to this graph such that it connects vertex v1 to v2. Equivalent to addEdge(e, new Pair(v1, v2)). If this graph does not contain v1, v2, or both, implementations may choose to either silently add the vertices to the graph or throw an IllegalArgumentException. If this graph assigns edge types to its edges, the edge type of e will be the default for this graph. See Hypergraph.addEdge() for a listing of possible reasons for failure.
    
    Specified by:
    
    addEdge in interface Graph<V,E>
    
    Parameters:
    
    e - the edge to be added
    
    v1 - the first vertex to be connected
    
    v2 - the second vertex to be connected
    
    Returns:
    
    true if the add is successful, false otherwise
    
    See Also:
    
    Graph.addEdge(Object, Object, Object, EdgeType)
  - addVertex
```
public boolean addVertex(V vertex)
```
    Description copied from interface: Hypergraph
    
    Adds vertex to this graph. Fails if vertex is null or already in the graph.
    
    Specified by:
    
    addVertex in interface Hypergraph<V,E>
    
    Parameters:
    
    vertex - the vertex to add
    
    Returns:
    
    true if the add is successful, and false otherwise
  - isIncident
```
public boolean isIncident(V vertex,
                          E edge)
```
    Description copied from interface: Hypergraph
    
    Returns true if vertex and edge are incident to each other. Equivalent to getIncidentEdges(vertex).contains(edge) and to getIncidentVertices(edge).contains(vertex).
    
    Specified by:
    
    isIncident in interface Hypergraph<V,E>
    
    Parameters:
    
    vertex - the vertex
    
    edge - the edge
    
    Returns:
    
    true if vertex and edge are incident to each other
  - isNeighbor
```
public boolean isNeighbor(V v1,
                          V v2)
```
    Description copied from interface: Hypergraph
    
    Returns true if v1 and v2 share an incident edge. Equivalent to getNeighbors(v1).contains(v2).
    
    Specified by:
    
    isNeighbor in interface Hypergraph<V,E>
    
    Parameters:
    
    v1 - the first vertex to test
    
    v2 - the second vertex to test
    
    Returns:
    
    true if v1 and v2 share an incident edge
  - degree
```
public int degree(V vertex)
```
    Description copied from interface: Hypergraph
    Returns the number of edges incident to vertex. Special cases of interest:
    - Incident self-loops are counted once.
    - If there is only one edge that connects this vertex to each of its neighbors (and vice versa), then the value returned will also be equal to the number of neighbors that this vertex has (that is, the output of getNeighborCount)
    - If the graph is directed, then the value returned will be the sum of this vertex's indegree (the number of edges whose destination is this vertex) and its outdegree (the number of edges whose source is this vertex), minus the number of incident self-loops (to avoid double-counting).
    Equivalent to getIncidentEdges(vertex).size().
    Specified by:
    
    degree in interface Hypergraph<V,E>
    
    Parameters:
    
    vertex - the vertex whose degree is to be returned
    
    Returns:
    
    the degree of this node
    
    See Also:
    
    Hypergraph.getNeighborCount(Object)
  - findEdge
```
public E findEdge(V v1,
                  V v2)
```
    Description copied from interface: Hypergraph
    Returns an edge that connects this vertex to v. If this edge is not uniquely defined (that is, if the graph contains more than one edge connecting v1 to v2), any of these edges may be returned. findEdgeSet(v1, v2) may be used to return all such edges. Returns null if either of the following is true:
    - v2 is not connected to v1
    - either v1 or v2 are not present in this graph
    Note: for purposes of this method, v1 is only considered to be connected to v2 via a given directed edge e if v1 == e.getSource() && v2 == e.getDest() evaluates to true. (v1 and v2 are connected by an undirected edge u if u is incident to both v1 and v2.)
    Specified by:
    
    findEdge in interface Hypergraph<V,E>
    
    Parameters:
    
    v1 - the first vertex
    
    v2 - the second vertex
    
    Returns:
    
    an edge that connects v1 to v2, or null if no such edge exists (or either vertex is not present)
    
    See Also:
    
    Hypergraph.findEdgeSet(Object, Object)
  - findEdgeSet
```
public java.util.Collection<E> findEdgeSet(V v1,
                                           V v2)
```
    Description copied from interface: Hypergraph
    
    Returns all edges that connects this vertex to v. If this edge is not uniquely defined (that is, if the graph contains more than one edge connecting v1 to v2), any of these edges may be returned. findEdgeSet(v1, v2) may be used to return all such edges. Returns null if v2 is not connected to v1. Returns an empty collection if either v1 or v2 are not present in this graph. Note: for purposes of this method, v1 is only considered to be connected to v2 via a given directed edge d if v1 == d.getSource() && v2 == d.getDest() evaluates to true. (v1 and v2 are connected by an undirected edge u if u is incident to both v1 and v2.)
    
    Specified by:
    
    findEdgeSet in interface Hypergraph<V,E>
    
    Parameters:
    
    v1 - the first vertex
    
    v2 - the second vertex
    
    Returns:
    
    a collection containing all edges that connect v1 to v2, or null if either vertex is not present
    
    See Also:
    
    Hypergraph.findEdge(Object, Object)
  - getDest
```
public V getDest(E directedEdge)
```
    Description copied from interface: Graph
    
    If directed_edge is a directed edge in this graph, returns the destination; otherwise returns null. The destination of a directed edge d is defined to be the vertex incident to d for which d is an incoming edge. directed_edge is guaranteed to be a directed edge if its EdgeType is DIRECTED.
    
    Specified by:
    
    getDest in interface Graph<V,E>
    
    Specified by:
    
    getDest in interface Hypergraph<V,E>
    
    Parameters:
    
    directedEdge - the edge
    
    Returns:
    
    the destination of directed_edge if it is a directed edge in this graph, or null otherwise
  - getEdgeCount
```
public int getEdgeCount()
```
    Description copied from interface: Hypergraph
    
    Returns the number of edges in this graph.
    
    Specified by:
    
    getEdgeCount in interface Hypergraph<V,E>
    
    Returns:
    
    the number of edges in this graph
  - getEdgeCount
```
public int getEdgeCount(EdgeType edgeType)
```
    Description copied from interface: Hypergraph
    
    Returns the number of edges of type edge_type in this graph.
    
    Specified by:
    
    getEdgeCount in interface Hypergraph<V,E>
    
    Parameters:
    
    edgeType - the type of edge for which the count is to be returned
    
    Returns:
    
    the number of edges of type edge_type in this graph
  - getEdgesView
```
public java.util.Collection<E> getEdgesView()
```
    Description copied from interface: Hypergraph
    
    Returns a view of all edges in this graph. In general, this obeys the Collection contract, and therefore makes no guarantees about the ordering of the vertices within the set.
    
    Specified by:
    
    getEdgesView in interface Hypergraph<V,E>
    
    Returns:
    
    a Collection view of all edges in this graph
  - getEdges
```
public java.util.Collection<E> getEdges(EdgeType edgeType)
```
    Description copied from interface: Hypergraph
    
    Returns the collection of edges in this graph which are of type edge_type.
    
    Specified by:
    
    getEdges in interface Hypergraph<V,E>
    
    Parameters:
    
    edgeType - the type of edges to be returned
    
    Returns:
    
    the collection of edges which are of type edge_type, or null if the graph does not accept edges of this type
    
    See Also:
    
    EdgeType
  - getEdgeType
```
public EdgeType getEdgeType(E edge)
```
    Description copied from interface: Hypergraph
    
    Returns the edge type of edge in this graph.
    
    Specified by:
    
    getEdgeType in interface Hypergraph<V,E>
    
    Returns:
    
    the EdgeType of edge, or null if edge has no defined type
  - getDefaultEdgeType
```
public EdgeType getDefaultEdgeType()
```
    Description copied from interface: Hypergraph
    
    Returns the default edge type for this graph.
    
    Specified by:
    
    getDefaultEdgeType in interface Hypergraph<V,E>
    
    Returns:
    
    the default edge type for this graph
  - getEndpoints
```
public Pair<V> getEndpoints(E edge)
```
    Description copied from interface: Graph
    
    Returns the endpoints of edge as a Pair.
    
    Specified by:
    
    getEndpoints in interface Graph<V,E>
    
    Parameters:
    
    edge - the edge whose endpoints are to be returned
    
    Returns:
    
    the endpoints (incident vertices) of edge
  - getIncidentCount
```
public int getIncidentCount(E edge)
```
    Description copied from interface: Hypergraph
    
    Returns the number of vertices that are incident to edge. For hyperedges, this can be any nonnegative integer; for edges this must be 2 (or 1 if self-loops are permitted). Equivalent to getIncidentVertices(edge).size().
    
    Specified by:
    
    getIncidentCount in interface Hypergraph<V,E>
    
    Parameters:
    
    edge - the edge whose incident vertex count is to be returned
    
    Returns:
    
    the number of vertices that are incident to edge.
  - getIncidentEdges
```
public java.util.Collection<E> getIncidentEdges(V vertex)
```
    Description copied from interface: Hypergraph
    
    Returns the collection of edges in this graph which are connected to vertex.
    
    Specified by:
    
    getIncidentEdges in interface Hypergraph<V,E>
    
    Parameters:
    
    vertex - the vertex whose incident edges are to be returned
    
    Returns:
    
    the collection of edges which are connected to vertex, or null if vertex is not present
  - getIncidentVertices
```
public java.util.Collection<V> getIncidentVertices(E edge)
```
    Description copied from interface: Hypergraph
    
    Returns the collection of vertices in this graph which are connected to edge. Note that for some graph types there are guarantees about the size of this collection (i.e., some graphs contain edges that have exactly two endpoints, which may or may not be distinct). Implementations for those graph types may provide alternate methods that provide more convenient access to the vertices.
    
    Specified by:
    
    getIncidentVertices in interface Hypergraph<V,E>
    
    Parameters:
    
    edge - the edge whose incident vertices are to be returned
    
    Returns:
    
    the collection of vertices which are connected to edge, or null if edge is not present
  - getInEdges
```
public java.util.Collection<E> getInEdges(V vertex)
```
    Description copied from interface: Graph
    
    Returns a Collection view of the incoming edges incident to vertex in this graph.
    
    Specified by:
    
    getInEdges in interface Graph<V,E>
    
    Specified by:
    
    getInEdges in interface Hypergraph<V,E>
    
    Parameters:
    
    vertex - the vertex whose incoming edges are to be returned
    
    Returns:
    
    a Collection view of the incoming edges incident to vertex in this graph
  - getNeighborCount
```
public int getNeighborCount(V vertex)
```
    Description copied from interface: Hypergraph
    
    Returns the number of vertices that are adjacent to vertex (that is, the number of vertices that are incident to edges in vertex's incident edge set). Equivalent to getNeighbors(vertex).size().
    
    Specified by:
    
    getNeighborCount in interface Hypergraph<V,E>
    
    Parameters:
    
    vertex - the vertex whose neighbor count is to be returned
    
    Returns:
    
    the number of neighboring vertices
  - getNeighbors
```
public java.util.Collection<V> getNeighbors(V vertex)
```
    Description copied from interface: Hypergraph
    
    Returns the collection of vertices which are connected to vertex via any edges in this graph. If vertex is connected to itself with a self-loop, then it will be included in the collection returned.
    
    Specified by:
    
    getNeighbors in interface Hypergraph<V,E>
    
    Parameters:
    
    vertex - the vertex whose neighbors are to be returned
    
    Returns:
    
    the collection of vertices which are connected to vertex, or null if vertex is not present
  - getOpposite
```
public V getOpposite(V vertex,
                     E edge)
```
    Description copied from interface: Graph
    
    Returns the vertex at the other end of edge from vertex. (That is, returns the vertex incident to edge which is not vertex.)
    
    Specified by:
    
    getOpposite in interface Graph<V,E>
    
    Parameters:
    
    vertex - the vertex to be queried
    
    edge - the edge to be queried
    
    Returns:
    
    the vertex at the other end of edge from vertex
  - getOutEdges
```
public java.util.Collection<E> getOutEdges(V vertex)
```
    Description copied from interface: Graph
    
    Returns a Collection view of the outgoing edges incident to vertex in this graph.
    
    Specified by:
    
    getOutEdges in interface Graph<V,E>
    
    Specified by:
    
    getOutEdges in interface Hypergraph<V,E>
    
    Parameters:
    
    vertex - the vertex whose outgoing edges are to be returned
    
    Returns:
    
    a Collection view of the outgoing edges incident to vertex in this graph
  - getPredecessorCount
```
public int getPredecessorCount(V vertex)
```
    Description copied from interface: Graph
    
    Returns the number of predecessors that vertex has in this graph. Equivalent to vertex.getPredecessors().size().
    
    Specified by:
    
    getPredecessorCount in interface Graph<V,E>
    
    Parameters:
    
    vertex - the vertex whose predecessor count is to be returned
    
    Returns:
    
    the number of predecessors that vertex has in this graph
  - getPredecessors
```
public java.util.Collection<V> getPredecessors(V vertex)
```
    Description copied from interface: Graph
    
    Returns a Collection view of the predecessors of vertex in this graph. A predecessor of vertex is defined as a vertex v which is connected to vertex by an edge e, where e is an outgoing edge of v and an incoming edge of vertex.
    
    Specified by:
    
    getPredecessors in interface Graph<V,E>
    
    Specified by:
    
    getPredecessors in interface Hypergraph<V,E>
    
    Parameters:
    
    vertex - the vertex whose predecessors are to be returned
    
    Returns:
    
    a Collection view of the predecessors of vertex in this graph
  - getSource
```
public V getSource(E directedEdge)
```
    Description copied from interface: Graph
    
    If directed_edge is a directed edge in this graph, returns the source; otherwise returns null. The source of a directed edge d is defined to be the vertex for which d is an outgoing edge. directed_edge is guaranteed to be a directed edge if its EdgeType is DIRECTED.
    
    Specified by:
    
    getSource in interface Graph<V,E>
    
    Specified by:
    
    getSource in interface Hypergraph<V,E>
    
    Parameters:
    
    directedEdge - the edge
    
    Returns:
    
    the source of directed_edge if it is a directed edge in this graph, or null otherwise
  - getSuccessorCount
```
public int getSuccessorCount(V vertex)
```
    Description copied from interface: Graph
    
    Returns the number of successors that vertex has in this graph. Equivalent to vertex.getSuccessors().size().
    
    Specified by:
    
    getSuccessorCount in interface Graph<V,E>
    
    Parameters:
    
    vertex - the vertex whose successor count is to be returned
    
    Returns:
    
    the number of successors that vertex has in this graph
  - getSuccessors
```
public java.util.Collection<V> getSuccessors(V vertex)
```
    Description copied from interface: Graph
    
    Returns a Collection view of the successors of vertex in this graph. A successor of vertex is defined as a vertex v which is connected to vertex by an edge e, where e is an incoming edge of v and an outgoing edge of vertex.
    
    Specified by:
    
    getSuccessors in interface Graph<V,E>
    
    Specified by:
    
    getSuccessors in interface Hypergraph<V,E>
    
    Parameters:
    
    vertex - the vertex whose predecessors are to be returned
    
    Returns:
    
    a Collection view of the successors of vertex in this graph
  - getVertexCount
```
public int getVertexCount()
```
    Description copied from interface: Hypergraph
    
    Returns the number of vertices in this graph.
    
    Specified by:
    
    getVertexCount in interface Hypergraph<V,E>
    
    Returns:
    
    the number of vertices in this graph
  - getVerticesView
```
public java.util.Collection<V> getVerticesView()
```
    Description copied from interface: Hypergraph
    
    Returns a view of all vertices in this graph. In general, this obeys the Collection contract, and therefore makes no guarantees about the ordering of the vertices within the set.
    
    Specified by:
    
    getVerticesView in interface Hypergraph<V,E>
    
    Returns:
    
    a Collection view of all vertices in this graph
  - inDegree
```
public int inDegree(V vertex)
```
    Description copied from interface: Graph
    
    Returns the number of incoming edges incident to vertex. Equivalent to getInEdges(vertex).size().
    
    Specified by:
    
    inDegree in interface Graph<V,E>
    
    Specified by:
    
    inDegree in interface Hypergraph<V,E>
    
    Parameters:
    
    vertex - the vertex whose indegree is to be calculated
    
    Returns:
    
    the number of incoming edges incident to vertex
  - isDest
```
public boolean isDest(V vertex,
                      E edge)
```
    Description copied from interface: Graph
    
    Returns true if vertex is the destination of edge. Equivalent to getDest(edge).equals(vertex).
    
    Specified by:
    
    isDest in interface Graph<V,E>
    
    Parameters:
    
    vertex - the vertex to be queried
    
    edge - the edge to be queried
    
    Returns:
    
    true iff vertex is the destination of edge
  - isPredecessor
```
public boolean isPredecessor(V v1,
                             V v2)
```
    Description copied from interface: Graph
    
    Returns true if v1 is a predecessor of v2 in this graph. Equivalent to v1.getPredecessors().contains(v2).
    
    Specified by:
    
    isPredecessor in interface Graph<V,E>
    
    Parameters:
    
    v1 - the first vertex to be queried
    
    v2 - the second vertex to be queried
    
    Returns:
    
    true if v1 is a predecessor of v2, and false otherwise.
  - isSource
```
public boolean isSource(V vertex,
                        E edge)
```
    Description copied from interface: Graph
    
    Returns true if vertex is the source of edge. Equivalent to getSource(edge).equals(vertex).
    
    Specified by:
    
    isSource in interface Graph<V,E>
    
    Parameters:
    
    vertex - the vertex to be queried
    
    edge - the edge to be queried
    
    Returns:
    
    true iff vertex is the source of edge
  - isSuccessor
```
public boolean isSuccessor(V v1,
                           V v2)
```
    Description copied from interface: Graph
    
    Returns true if v1 is a successor of v2 in this graph. Equivalent to v1.getSuccessors().contains(v2).
    
    Specified by:
    
    isSuccessor in interface Graph<V,E>
    
    Parameters:
    
    v1 - the first vertex to be queried
    
    v2 - the second vertex to be queried
    
    Returns:
    
    true if v1 is a successor of v2, and false otherwise.
  - outDegree
```
public int outDegree(V vertex)
```
    Description copied from interface: Graph
    
    Returns the number of outgoing edges incident to vertex. Equivalent to getOutEdges(vertex).size().
    
    Specified by:
    
    outDegree in interface Graph<V,E>
    
    Specified by:
    
    outDegree in interface Hypergraph<V,E>
    
    Parameters:
    
    vertex - the vertex whose outdegree is to be calculated
    
    Returns:
    
    the number of outgoing edges incident to vertex
  - removeEdge
```
public boolean removeEdge(E edge)
```
    Description copied from interface: Hypergraph
    
    Removes edge from this graph. Fails if edge is null, or is otherwise not an element of this graph.
    
    Specified by:
    
    removeEdge in interface Hypergraph<V,E>
    
    Parameters:
    
    edge - the edge to remove
    
    Returns:
    
    true if the removal is successful, false otherwise
  - removeVertex
```
public boolean removeVertex(V vertex)
```
    Description copied from interface: Hypergraph
    Removes vertex from this graph. As a side effect, removes any edges e incident to vertex if the removal of vertex would cause e to be incident to an illegal number of vertices. (Thus, for example, incident hyperedges are not removed, but incident edges--which must be connected to a vertex at both endpoints--are removed.) Fails under the following circumstances:
    - vertex is not an element of this graph
    - vertex is null
    Specified by:
    
    removeVertex in interface Hypergraph<V,E>
    
    Parameters:
    
    vertex - the vertex to remove
    
    Returns:
    
    true if the removal is successful, false otherwise
  - containsEdge
```
public boolean containsEdge(E edge)
```
    Description copied from interface: Hypergraph
    
    Returns true if this graph's edge collection contains edge. Equivalent to getEdges().contains(edge).
    
    Specified by:
    
    containsEdge in interface Hypergraph<V,E>
    
    Parameters:
    
    edge - the edge whose presence is being queried
    
    Returns:
    
    true iff this graph contains an edge edge
  - containsVertex
```
public boolean containsVertex(V vertex)
```
    Description copied from interface: Hypergraph
    
    Returns true if this graph's vertex collection contains vertex. Equivalent to getVertices().contains(vertex).
    
    Specified by:
    
    containsVertex in interface Hypergraph<V,E>
    
    Parameters:
    
    vertex - the vertex whose presence is being queried
    
    Returns:
    
    true iff this graph contains a vertex vertex

Class GraphDecorator<V,E>

Field Summary

Constructor Summary

Method Summary

Methods inherited from class java.lang.Object

Field Detail

delegate

Constructor Detail

GraphDecorator

Method Detail

addEdgeWithVertices

addEdgeWithVertices

addEdge

addEdge

addVertex

isIncident

isNeighbor

degree

findEdge

findEdgeSet

getDest

getEdgeCount

getEdgeCount

getEdgesView

getEdges

getEdgeType

getDefaultEdgeType

getEndpoints

getIncidentCount

getIncidentEdges

getIncidentVertices

getInEdges

getNeighborCount

getNeighbors

getOpposite

getOutEdges

getPredecessorCount

getPredecessors

getSource

getSuccessorCount

getSuccessors

getVertexCount

getVerticesView

inDegree

isDest

isPredecessor

isSource

isSuccessor

outDegree

removeEdge

removeVertex

containsEdge

containsVertex