Package | Description |
---|---|
edu.uci.ics.jung.algorithms.blockmodel |
Support for establishing and maintaining graph element equivalence (such as in blockmodeling).
|
edu.uci.ics.jung.graph |
Interfaces for the JUNG graph types, and some representative implementations.
|
edu.uci.ics.jung.visualization.spatial |
Modifier and Type | Method and Description |
---|---|
protected Set<Pair<V>> |
StructurallyEquivalent.getEquivalentPairs(Graph<V,?> g)
For each vertex pair v, v1 in G, checks whether v and v1 are fully
equivalent: meaning that they connect to the exact same vertices.
|
Modifier and Type | Field and Description |
---|---|
protected Map<E,Pair<V>> |
SparseGraph.directed_edges |
protected Map<E,Pair<V>> |
OrderedKAryTree.edge_vpairs |
protected Map<E,Pair<V>> |
UndirectedSparseMultigraph.edges |
protected Map<E,Pair<V>> |
UndirectedSparseGraph.edges |
protected Map<E,Pair<V>> |
SparseMultigraph.edges |
protected Map<E,Pair<V>> |
DirectedSparseMultigraph.edges |
protected Map<E,Pair<V>> |
DirectedSparseGraph.edges |
protected Map<E,Pair<V>> |
SparseGraph.undirected_edges |
protected Map<V,Pair<Set<E>>> |
SparseMultigraph.vertices |
protected Map<V,Pair<Set<E>>> |
DirectedSparseMultigraph.vertices |
protected Map<V,Pair<Map<V,E>>> |
DirectedSparseGraph.vertices |
Modifier and Type | Method and Description |
---|---|
Pair<V> |
UndirectedSparseMultigraph.getEndpoints(E edge) |
Pair<V> |
UndirectedSparseGraph.getEndpoints(E edge) |
Pair<V> |
SparseMultigraph.getEndpoints(E edge) |
Pair<V> |
SparseGraph.getEndpoints(E edge) |
Pair<V> |
OrderedKAryTree.getEndpoints(E edge) |
Pair<V> |
DirectedSparseMultigraph.getEndpoints(E edge) |
Pair<V> |
DirectedSparseGraph.getEndpoints(E edge) |
Pair<V> |
GraphDecorator.getEndpoints(E edge) |
Pair<V> |
Graph.getEndpoints(E edge)
Returns the endpoints of
edge as a Pair . |
protected Pair<V> |
AbstractGraph.getValidatedEndpoints(E edge,
Pair<? extends V> endpoints) |
Modifier and Type | Method and Description |
---|---|
boolean |
AbstractGraph.addEdge(E edge,
Pair<? extends V> endpoints)
Adds
edge to this graph with the specified endpoints ,
with the default edge type. |
boolean |
UndirectedSparseMultigraph.addEdge(E edge,
Pair<? extends V> endpoints,
EdgeType edge_type) |
boolean |
UndirectedSparseGraph.addEdge(E edge,
Pair<? extends V> endpoints,
EdgeType edgeType) |
boolean |
SparseMultigraph.addEdge(E edge,
Pair<? extends V> endpoints,
EdgeType edgeType) |
boolean |
SparseGraph.addEdge(E edge,
Pair<? extends V> endpoints,
EdgeType edgeType) |
boolean |
OrderedKAryTree.addEdge(E edge,
Pair<? extends V> endpoints,
EdgeType edgeType) |
boolean |
DirectedSparseMultigraph.addEdge(E edge,
Pair<? extends V> endpoints,
EdgeType edgeType) |
boolean |
DirectedSparseGraph.addEdge(E edge,
Pair<? extends V> endpoints,
EdgeType edgeType) |
abstract boolean |
AbstractGraph.addEdge(E edge,
Pair<? extends V> endpoints,
EdgeType edgeType)
Adds
edge to this graph with the specified endpoints
and EdgeType . |
protected Pair<V> |
AbstractGraph.getValidatedEndpoints(E edge,
Pair<? extends V> endpoints) |
Modifier and Type | Method and Description |
---|---|
Pair<V> |
FastRenderingGraph.getEndpoints(E edge) |
Pair<V> |
AggregateGraph.getEndpoints(E edge) |
Copyright © 2015. All rights reserved.