edu.uci.ics.jung.graph
Interface DirectedGraph<V,E>

Type Parameters:

V - type specification for vertices

E - type specification for edges

All Superinterfaces:

Graph<V,E>, Hypergraph<V,E>

All Known Subinterfaces:

Forest<V,E>, Tree<V,E>

All Known Implementing Classes:

DelegateForest, DelegateTree, DirectedOrderedSparseMultigraph, DirectedSparseGraph, DirectedSparseMultigraph, OrderedKAryTree

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

A tagging interface for implementations of Graph that accept only directed edges.

Author:

Tom Nelson - tomnelson@dev.java.net

Method Summary

Methods inherited from interface edu.uci.ics.jung.graph.Graph

addEdge, addEdge, getDest, getEndpoints, getInEdges, getOpposite, getOutEdges, getPredecessorCount, getPredecessors, getSource, getSuccessorCount, getSuccessors, inDegree, isDest, isPredecessor, isSource, isSuccessor, outDegree

Methods inherited from interface edu.uci.ics.jung.graph.Hypergraph

addEdge, addEdge, addVertex, containsEdge, containsVertex, degree, findEdge, findEdgeSet, getDefaultEdgeType, getEdgeCount, getEdgeCount, getEdges, getEdges, getEdgeType, getIncidentCount, getIncidentEdges, getIncidentVertices, getNeighborCount, getNeighbors, getVertexCount, getVertices, isIncident, isNeighbor, removeEdge, removeVertex