Opus5
Interface Digraph

All Superinterfaces:

Comparable, Container, Graph

All Known Implementing Classes:

DigraphAsMatrix, DigraphAsLists

public interface Digraph

extends Graph

Encapsulates methods common to all directed graph.

Version:

$Id: Digraph.java,v 3.2 1998/07/28 13:35:44 brpreiss Exp $

Author:

Bruno R. Preiss, P.Eng.

Field Summary

static java.lang.String

copyright

Method Summary

boolean	isStronglyConnected() Tests whether this graph is strongly connected.
void	topologicalOrderTraversal(Visitor visitor) Causes a visitor to visit the vertices of this directed graph in topological order.

Methods inherited from interface Opus5.Graph

addEdge, addEdge, addVertex, addVertex, breadthFirstTraversal, depthFirstTraversal, getEdge, getEdges, getNumberOfEdges, getNumberOfVertices, getVertex, getVertices, isConnected, isCyclic, isDirected, isEdge

Methods inherited from interface Opus5.Container

accept, getCount, getEnumeration, isEmpty, isFull, purge

Methods inherited from interface Opus5.Comparable

compare, isEQ, isGE, isGT, isLE, isLT, isNE

Field Detail

copyright

public static final java.lang.String copyright

Method Detail

isStronglyConnected

public boolean isStronglyConnected()

Tests whether this graph is strongly connected.

Returns:

True if this graph is strongly connected; false otherwise.

See Also:

Graph.isConnected()

topologicalOrderTraversal

public void topologicalOrderTraversal(Visitor visitor)

Causes a visitor to visit the vertices of this directed graph in topological order. This method takes a visitor and, as long as the IsDone method of that visitor returns false, this method invokes the Visit method of the visitor for each vertex in the graph. The order in which the vertices are visited is given by a topological sort of the vertices.

Parameters:

visitor - The visitor to accept.

See Also:

Visitor