scratch.joshua.jung_2_0.core
Interface Graph<V,E>

All Superinterfaces:
ArchetypeGraph<V,E>
All Known Subinterfaces:
DirectedGraph<V,E>, UndirectedGraph<V,E>
All Known Implementing Classes:
SimpleAbstractSparseGraph, SimpleDirectedSparseGraph, SimpleUndirectedSparseGraph

public interface Graph<V,E>
extends ArchetypeGraph<V,E>


Method Summary
 Pair<V> getEndpoints(E edge)
           
 Collection<E> getInEdges(V vertex)
           
 V getOpposite(V vertex, E edge)
           
 Collection<E> getOutEdges(V vertex)
           
 Collection<V> getPredecessors(V vertex)
           
 Collection<V> getSuccessors(V vertex)
           
 int inDegree(V vertex)
           
 boolean isPredecessor(V v1, V v2)
           
 boolean isSuccessor(V v1, V v2)
           
 int numPredecessors(V vertex)
           
 int numSuccessors(V vertex)
           
 int outDegree(V vertex)
           
 
Methods inherited from interface scratch.joshua.jung_2_0.core.ArchetypeGraph
addVertex, areIncident, areNeighbors, degree, findEdge, getEdges, getIncidentEdges, getIncidentVertices, getNeighbors, getVertices, numNeighbors, removeEdge, removeVertex
 

Method Detail

getInEdges

Collection<E> getInEdges(V vertex)

getOutEdges

Collection<E> getOutEdges(V vertex)

getPredecessors

Collection<V> getPredecessors(V vertex)

getSuccessors

Collection<V> getSuccessors(V vertex)

getEndpoints

Pair<V> getEndpoints(E edge)

getOpposite

V getOpposite(V vertex,
              E edge)

inDegree

int inDegree(V vertex)

outDegree

int outDegree(V vertex)

isPredecessor

boolean isPredecessor(V v1,
                      V v2)

isSuccessor

boolean isSuccessor(V v1,
                    V v2)

numPredecessors

int numPredecessors(V vertex)

numSuccessors

int numSuccessors(V vertex)