public abstract class SimpleAbstractSparseGraph<V,E> extends java.lang.Object implements Graph<V,E>
| Constructor and Description |
|---|
SimpleAbstractSparseGraph() |
| Modifier and Type | Method and Description |
|---|---|
boolean |
areIncident(V vertex,
E edge) |
boolean |
areNeighbors(V v1,
V v2) |
int |
degree(V vertex) |
java.util.Collection<V> |
getIncidentVertices(E edge) |
V |
getOpposite(V vertex,
E edge) |
int |
inDegree(V vertex) |
boolean |
isPredecessor(V v1,
V v2) |
boolean |
isSuccessor(V v1,
V v2) |
int |
numNeighbors(V vertex) |
int |
numPredecessors(V vertex) |
int |
numSuccessors(V vertex) |
int |
outDegree(V vertex) |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, waitgetEndpoints, getInEdges, getOutEdges, getPredecessors, getSuccessorsaddVertex, findEdge, getEdges, getIncidentEdges, getNeighbors, getVertices, removeEdge, removeVertexpublic boolean isPredecessor(V v1, V v2)
isPredecessor in interface Graph<V,E>public boolean isSuccessor(V v1, V v2)
isSuccessor in interface Graph<V,E>public int numPredecessors(V vertex)
numPredecessors in interface Graph<V,E>public int numSuccessors(V vertex)
numSuccessors in interface Graph<V,E>public boolean areNeighbors(V v1, V v2)
areNeighbors in interface ArchetypeGraph<V,E>public boolean areIncident(V vertex, E edge)
areIncident in interface ArchetypeGraph<V,E>public int numNeighbors(V vertex)
numNeighbors in interface ArchetypeGraph<V,E>public int degree(V vertex)
degree in interface ArchetypeGraph<V,E>public V getOpposite(V vertex, E edge)
getOpposite in interface Graph<V,E>public java.util.Collection<V> getIncidentVertices(E edge)
getIncidentVertices in interface ArchetypeGraph<V,E>