<?xml version="1.0" encoding='utf-8'?>
<!DOCTYPE wml PUBLIC "-//WAPFORUM//DTD WML 1.1//EN" "http://www.wapforum.org/DTD/wml_1.1.xml">
<wml>
<card id="card1" title="Cycle detection - Page 7 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=Cycle_detection&amp;p=6">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Cycle_detection&amp;p=8">3.Next</a>
</p>
<p>outgoing edge) the vertices of which are the elements of  and the edges of which map an element to the corresponding function value, as shown in the figure. The set of vertices <a href="page.php?w=Reachability">reachable</a> from  starting vertex  form a subgraph with a shape resembling the <a href="page.php?w=Rho_%28letter%29">Greek letter rho</a> : a path of length  from  to a <a href="page.php?w=Cycle_%28graph_theory%29">cycle</a> of  vertices.</p>

<p>Practical cycle-detection algorithms do not find  and  exactly.  They usually find lower</p><p>
<a accesskey="1" href="page.php?w=Cycle_detection&amp;p=6">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Cycle_detection&amp;p=8">3.Next</a>
</p>

<do type="prev" label="Search">
        <go href="search.wml"/>
</do>

</card>
</wml>
