Data Structures and Algorithms
with Object-Oriented Design Patterns in C#
|
|
Program
defines the Digraph interface.
The Digraph interface extends the Graph interface
defined in Program
.

Program: Digraph interface.
The Digraph interface adds the following operations
which apply only to directed graphs
to the inherited interface:
- IsStronglyConnected
-
This bool-valued property is true
if the directed graph is strongly connected.
Strong connectedness is discussed in Section
.
- TopologicalOrderTraversal
-
A topological sort is an ordering of the nodes of a directed graph.
This traversal visits the nodes of a directed graph in the order
specified by a topological sort.
Copyright © 2001 by Bruno R. Preiss, P.Eng. All rights reserved.