<?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="Distance matrix - Page 3 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=distance_matrix&amp;p=2">1.Previous</a><br />
<a accesskey="3" href="page.php?w=distance_matrix&amp;p=4">3.Next</a>
</p>
<p>of the weights on the shortest paths joining the two nodes (where the number of steps in the path is bounded). This distance function, while well defined, is not a metric. There need be no restrictions on the weights other than the need to be able to combine and compare them, so negative weights are used in some applications. Since paths are directed, symmetry can not be guaranteed, and if negative-weight cycles exist the distance matrix may not be <a href="page.php?w=Hollow_matrix">hollow</a> (and in the absence of a bound on the step count,</p><p>
<a accesskey="1" href="page.php?w=distance_matrix&amp;p=2">1.Previous</a><br />
<a accesskey="3" href="page.php?w=distance_matrix&amp;p=4">3.Next</a>
</p>

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

</card>
</wml>
