fi.uef.cs.tra

Class DiGraph

java.lang.Object

fi.uef.cs.tra.AbstractGraph

fi.uef.cs.tra.DiGraph

All Implemented Interfaces:

java.lang.Iterable

public class DiGraph
extends AbstractGraph
implements java.lang.Iterable

A DiGraph or a directed graph is an ordered pair G := (V, A) with

• V, a set of vertices and
• A, a set of directed edges.

An edge e = (x, y) is considered to be directed from x to y.
DiGraph is simply a subclass of the abstract class AbstractGraph that sets it up in directed mode.

Example:

     void dfsColor(Vertex vertex, int color) {
       vertex.setColor(color);
       for (Vertex neighborVertex : vertex.neighbours())
         if (neighborVertex.getColor() != color)
             dfsColor(neighborVertex, color);
     }
 

See Also:

Vertex, Edge, Graph, AbstractGraph

Nested Class Summary

Nested classes/interfaces inherited from class fi.uef.cs.tra.AbstractGraph

AbstractGraph.EdgeIteratorWrapper, AbstractGraph.VertexIteratorWrapper

Field Summary

Fields inherited from class fi.uef.cs.tra.AbstractGraph

BLACK, BLUE, GRAY, GREEN, GREY, NaN, RED, WHITE

Constructor Summary

Constructors

Constructor and Description
DiGraph()

Method Summary

Methods inherited from class fi.uef.cs.tra.AbstractGraph

addVertex, addVertex, addVertex, addVertex, addVertex, addVertex, addVertex, addVertex, addVertex, addVertex, addVertex, addVertex, edgeIterator, edges, firstVertex, isDiGraph, iterator, removeVertex, size, toString, vertexCount, vertexIterator, vertices

Methods inherited from class java.lang.Object

equals, getClass, hashCode, notify, notifyAll, wait, wait, wait

Methods inherited from interface java.lang.Iterable

forEach, iterator, spliterator

Constructor Detail

DiGraph

public DiGraph()