<?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="Path (graph theory) - Page 4 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=Path_(graph_theory)&amp;p=3">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Path_%28graph_theory%29&amp;p=5">3.Next</a>
</p>
<p>a first vertex but no last vertex.<br/>
* A <b>trail</b> is a walk in which all edges are distinct.<br/>
* A <b>path</b> is a trail in which all vertices (and therefore also all edges) are distinct.</p>

<p>If  is a finite walk with vertex sequence  then  is said to be a walk from  to . Similarly for a trail or a path. If there is a finite walk between two distinct vertices then there is also a finite trail and a finite path between them.</p>

<p>Some authors do not require that all vertices of a path be distinct and instead use the term <b>simple</b></p><p>
<a accesskey="1" href="page.php?w=Path_(graph_theory)&amp;p=3">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Path_%28graph_theory%29&amp;p=5">3.Next</a>
</p>

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

</card>
</wml>
