<?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="Dependency graph - Page 5 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=dependency_graph&amp;p=4">1.Previous</a><br />
<a accesskey="3" href="page.php?w=dependency_graph&amp;p=6">3.Next</a>
</p>
<p>to provide appropriate handling for the detected cycles.</p>

<p>Assume the simple calculator from before. The equation system "A=B; B=D+C; C=D+A; D=12;" contains a <a href="page.php?w=circular_dependency">circular dependency</a> formed by A, B and C, as B must be evaluated before A, C must be evaluated before B, and A must be evaluated before C.</p>

<p><big> Deriving an evaluation order </big></p>
<p>A <b>correct evaluation order</b> is a numbering  of the objects that form the nodes of the dependency graph so that the following equation holds:  with</p><p>
<a accesskey="1" href="page.php?w=dependency_graph&amp;p=4">1.Previous</a><br />
<a accesskey="3" href="page.php?w=dependency_graph&amp;p=6">3.Next</a>
</p>

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

</card>
</wml>
