AggregateGraph (JUNG - Visualization Support 2.1.1 API)

java.lang.Object
- edu.uci.ics.jung.visualization.spatial.AggregateGraph<V,E>

All Implemented Interfaces:: Graph<V,E>, Hypergraph<V,E>

public class AggregateGraph<V,E>
extends Object
implements Graph<V,E>

Constructor Summary

Constructors
Constructor and Description

AggregateGraph()

Constructors
Constructor and Description
`AggregateGraph()`

Method Summary

All Methods Instance Methods Concrete Methods
Modifier and Type	Method and Description
`boolean`	`addEdge(E edge, Collection<? extends V> vertices)`
`boolean`	`addEdge(E edge, Collection<? extends V> vertices, EdgeType edgeType)`
`boolean`	`addEdge(E e, V v1, V v2)`
`boolean`	`addEdge(E e, V v1, V v2, EdgeType edgeType)`
`boolean`	`addVertex(V vertex)`
`boolean`	`containsEdge(E edge)`
`boolean`	`containsVertex(V vertex)`
`int`	`degree(V vertex)`
`E`	`findEdge(V v1, V v2)`
`Collection<E>`	`findEdgeSet(V v1, V v2)`
`EdgeType`	`getDefaultEdgeType()`
`V`	`getDest(E directedEdge)`
`int`	`getEdgeCount()`
`int`	`getEdgeCount(EdgeType edgeType)`
`Collection<E>`	`getEdges()`
`Collection<E>`	`getEdges(EdgeType edgeType)`
`EdgeType`	`getEdgeType(E edge)`
`Pair<V>`	`getEndpoints(E edge)`
`int`	`getIncidentCount(E edge)`
`Collection<E>`	`getIncidentEdges(V vertex)`
`Collection<V>`	`getIncidentVertices(E edge)`
`Collection<E>`	`getInEdges(V vertex)`
`int`	`getNeighborCount(V vertex)`
`Collection<V>`	`getNeighbors(V vertex)`
`V`	`getOpposite(V vertex, E edge)`
`Collection<E>`	`getOutEdges(V vertex)`
`int`	`getPredecessorCount(V vertex)`
`Collection<V>`	`getPredecessors(V vertex)`
`V`	`getSource(E directedEdge)`
`int`	`getSuccessorCount(V vertex)`
`Collection<V>`	`getSuccessors(V vertex)`
`int`	`getVertexCount()`
`Collection<V>`	`getVertices()`
`int`	`inDegree(V vertex)`
`boolean`	`isDest(V vertex, E edge)`
`boolean`	`isIncident(V vertex, E edge)`
`boolean`	`isNeighbor(V v1, V v2)`
`boolean`	`isPredecessor(V v1, V v2)`
`boolean`	`isSource(V vertex, E edge)`
`boolean`	`isSuccessor(V v1, V v2)`
`int`	`outDegree(V vertex)`
`boolean`	`removeEdge(E edge)`
`boolean`	`removeVertex(V vertex)`

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

- Constructor Detail
  - AggregateGraph
```
public AggregateGraph()
```
- Method Detail
  - addEdge
```
public boolean addEdge(E e,
                       V v1,
                       V v2)
```
    Specified by:
    
    addEdge in interface Graph<V,E>
  - addEdge
```
public boolean addEdge(E e,
                       V v1,
                       V v2,
                       EdgeType edgeType)
```
    Specified by:
    
    addEdge in interface Graph<V,E>
  - getDest
```
public V getDest(E directedEdge)
```
    Specified by:
    
    getDest in interface Graph<V,E>
    
    Specified by:
    
    getDest in interface Hypergraph<V,E>
  - getEndpoints
```
public Pair<V> getEndpoints(E edge)
```
    Specified by:
    
    getEndpoints in interface Graph<V,E>
  - getInEdges
```
public Collection<E> getInEdges(V vertex)
```
    Specified by:
    
    getInEdges in interface Graph<V,E>
    
    Specified by:
    
    getInEdges in interface Hypergraph<V,E>
  - getOpposite
```
public V getOpposite(V vertex,
                     E edge)
```
    Specified by:
    
    getOpposite in interface Graph<V,E>
  - getOutEdges
```
public Collection<E> getOutEdges(V vertex)
```
    Specified by:
    
    getOutEdges in interface Graph<V,E>
    
    Specified by:
    
    getOutEdges in interface Hypergraph<V,E>
  - getPredecessorCount
```
public int getPredecessorCount(V vertex)
```
    Specified by:
    
    getPredecessorCount in interface Graph<V,E>
  - getPredecessors
```
public Collection<V> getPredecessors(V vertex)
```
    Specified by:
    
    getPredecessors in interface Graph<V,E>
    
    Specified by:
    
    getPredecessors in interface Hypergraph<V,E>
  - getSource
```
public V getSource(E directedEdge)
```
    Specified by:
    
    getSource in interface Graph<V,E>
    
    Specified by:
    
    getSource in interface Hypergraph<V,E>
  - getSuccessorCount
```
public int getSuccessorCount(V vertex)
```
    Specified by:
    
    getSuccessorCount in interface Graph<V,E>
  - getSuccessors
```
public Collection<V> getSuccessors(V vertex)
```
    Specified by:
    
    getSuccessors in interface Graph<V,E>
    
    Specified by:
    
    getSuccessors in interface Hypergraph<V,E>
  - inDegree
```
public int inDegree(V vertex)
```
    Specified by:
    
    inDegree in interface Graph<V,E>
    
    Specified by:
    
    inDegree in interface Hypergraph<V,E>
  - isDest
```
public boolean isDest(V vertex,
                      E edge)
```
    Specified by:
    
    isDest in interface Graph<V,E>
  - isPredecessor
```
public boolean isPredecessor(V v1,
                             V v2)
```
    Specified by:
    
    isPredecessor in interface Graph<V,E>
  - isSource
```
public boolean isSource(V vertex,
                        E edge)
```
    Specified by:
    
    isSource in interface Graph<V,E>
  - isSuccessor
```
public boolean isSuccessor(V v1,
                           V v2)
```
    Specified by:
    
    isSuccessor in interface Graph<V,E>
  - outDegree
```
public int outDegree(V vertex)
```
    Specified by:
    
    outDegree in interface Graph<V,E>
    
    Specified by:
    
    outDegree in interface Hypergraph<V,E>
  - addEdge
```
public boolean addEdge(E edge,
                       Collection<? extends V> vertices)
```
    Specified by:
    
    addEdge in interface Hypergraph<V,E>
  - addEdge
```
public boolean addEdge(E edge,
                       Collection<? extends V> vertices,
                       EdgeType edgeType)
```
    Specified by:
    
    addEdge in interface Hypergraph<V,E>
  - addVertex
```
public boolean addVertex(V vertex)
```
    Specified by:
    
    addVertex in interface Hypergraph<V,E>
  - containsEdge
```
public boolean containsEdge(E edge)
```
    Specified by:
    
    containsEdge in interface Hypergraph<V,E>
  - containsVertex
```
public boolean containsVertex(V vertex)
```
    Specified by:
    
    containsVertex in interface Hypergraph<V,E>
  - degree
```
public int degree(V vertex)
```
    Specified by:
    
    degree in interface Hypergraph<V,E>
  - findEdge
```
public E findEdge(V v1,
                  V v2)
```
    Specified by:
    
    findEdge in interface Hypergraph<V,E>
  - findEdgeSet
```
public Collection<E> findEdgeSet(V v1,
                                 V v2)
```
    Specified by:
    
    findEdgeSet in interface Hypergraph<V,E>
  - getDefaultEdgeType
```
public EdgeType getDefaultEdgeType()
```
    Specified by:
    
    getDefaultEdgeType in interface Hypergraph<V,E>
  - getEdgeCount
```
public int getEdgeCount()
```
    Specified by:
    
    getEdgeCount in interface Hypergraph<V,E>
  - getEdgeCount
```
public int getEdgeCount(EdgeType edgeType)
```
    Specified by:
    
    getEdgeCount in interface Hypergraph<V,E>
  - getEdgeType
```
public EdgeType getEdgeType(E edge)
```
    Specified by:
    
    getEdgeType in interface Hypergraph<V,E>
  - getEdges
```
public Collection<E> getEdges()
```
    Specified by:
    
    getEdges in interface Hypergraph<V,E>
  - getEdges
```
public Collection<E> getEdges(EdgeType edgeType)
```
    Specified by:
    
    getEdges in interface Hypergraph<V,E>
  - getIncidentCount
```
public int getIncidentCount(E edge)
```
    Specified by:
    
    getIncidentCount in interface Hypergraph<V,E>
  - getIncidentEdges
```
public Collection<E> getIncidentEdges(V vertex)
```
    Specified by:
    
    getIncidentEdges in interface Hypergraph<V,E>
  - getIncidentVertices
```
public Collection<V> getIncidentVertices(E edge)
```
    Specified by:
    
    getIncidentVertices in interface Hypergraph<V,E>
  - getNeighborCount
```
public int getNeighborCount(V vertex)
```
    Specified by:
    
    getNeighborCount in interface Hypergraph<V,E>
  - getNeighbors
```
public Collection<V> getNeighbors(V vertex)
```
    Specified by:
    
    getNeighbors in interface Hypergraph<V,E>
  - getVertexCount
```
public int getVertexCount()
```
    Specified by:
    
    getVertexCount in interface Hypergraph<V,E>
  - getVertices
```
public Collection<V> getVertices()
```
    Specified by:
    
    getVertices in interface Hypergraph<V,E>
  - isIncident
```
public boolean isIncident(V vertex,
                          E edge)
```
    Specified by:
    
    isIncident in interface Hypergraph<V,E>
  - isNeighbor
```
public boolean isNeighbor(V v1,
                          V v2)
```
    Specified by:
    
    isNeighbor in interface Hypergraph<V,E>
  - removeEdge
```
public boolean removeEdge(E edge)
```
    Specified by:
    
    removeEdge in interface Hypergraph<V,E>
  - removeVertex
```
public boolean removeVertex(V vertex)
```
    Specified by:
    
    removeVertex in interface Hypergraph<V,E>

Class AggregateGraph<V,E>

Constructor Summary

Method Summary

Methods inherited from class java.lang.Object

Constructor Detail

AggregateGraph

Method Detail

addEdge

addEdge

getDest

getEndpoints

getInEdges

getOpposite

getOutEdges

getPredecessorCount

getPredecessors

getSource

getSuccessorCount

getSuccessors

inDegree

isDest

isPredecessor

isSource

isSuccessor

outDegree

addEdge

addEdge

addVertex

containsEdge

containsVertex

degree

findEdge

findEdgeSet

getDefaultEdgeType

getEdgeCount

getEdgeCount

getEdgeType

getEdges

getEdges

getIncidentCount

getIncidentEdges

getIncidentVertices

getNeighborCount

getNeighbors

getVertexCount

getVertices

isIncident

isNeighbor

removeEdge

removeVertex