Data Structures and Algorithms with Object-Oriented Design Patterns in C#
next up previous contents index

Graph Traversal Applications:
Testing for Cycles and Connectedness

 

This section presents several graph algorithms that are based on graph traversals. The first two algorithms test undirected and directed graphs for connectedness. Both algorithms are implemented using the depth-first traversal. The third algorithm tests a directed graph for cycles. It is implemented using a topological-order traversal.




next up previous contents index

Bruno Copyright © 2001 by Bruno R. Preiss, P.Eng. All rights reserved.