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

More Terminology

Consider the path tex2html_wrap_inline70412 in a directed graph tex2html_wrap_inline70252.

Referring again to graph tex2html_wrap_inline70346 in Figure gif we find that the path tex2html_wrap_inline66273 is a simple path of length three. Conversely, the path tex2html_wrap_inline70462 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_inline70466 which is a cycle of length three, as well as tex2html_wrap_inline70468, a cycle of length four. The former is a simple cycle but the latter is not.


next up previous contents index

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