org.apache.commons.graph
Interface DirectedGraph<V extends Vertex,E extends Edge<V>>

Type Parameters:

V - the Graph vertices type

E - the Graph edges type

All Superinterfaces:

Graph<V,E>

All Known Subinterfaces:

MutableDirectedGraph<V,E>

All Known Implementing Classes:

DirectedMutableGraph, DirectedMutableWeightedGraph

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

A DirectedGraph or digraph is an ordered pair D = ( V, E ) with

V a set whose elements are called vertices or nodes, and E a set of ordered pairs of vertices, called arcs, directed edges, or arrows.

Method Summary

Set<E>	getInbound(V v) Returns the set of Edges which are inbound to the Vertex.
Set<E>	getOutbound(V v) Returns the set of Edges which lead away from the Vertex.

Methods inherited from interface org.apache.commons.graph.Graph

getEdges, getEdges, getVertices, getVertices

Method Detail

getInbound

Set<E> getInbound(V v)

Returns the set of Edges which are inbound to the Vertex.

Parameters:

v - the Vertex which inbound Edges have to be returned

Returns:

the set of Edges which are inbound to the Vertex.

getOutbound

Set<E> getOutbound(V v)

Returns the set of Edges which lead away from the Vertex.

Parameters:

v - the Vertex which outbound Edges have to be returned

Returns:

the set of Edges which lead away from the Vertex.