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

More Terminology

Consider the path tex2html_wrap_inline71515 in a directed graph tex2html_wrap_inline71355.

Referring again to graph tex2html_wrap_inline71449 in Figure gif we find that the path tex2html_wrap_inline67120 is a simple path of length three. Conversely, the path tex2html_wrap_inline71565 also has length three but is not simple because vertex c occurs twice in the sequence (but not at the ends). The graph contains the path tex2html_wrap_inline71569 which is a cycle of length three, as well as tex2html_wrap_inline71571, a cycle of length four. The former is a simple cycle but the latter is not.


next up previous contents index

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