Go backward to Go up to TopGo forward to Path Properties |

*Definition:*
A *path* is a sequence of nodes connected by edges:

pis path inG: <=>( existsninN_{>0}:p:N_{n}->V/\foralliinN_{n-1}: <p_{i},p_{i+1}> inE)whereV=G_{0},E=G_{1}.

The *length* of a path is the number of edges
it contains:

A path

length( p) :=suchninN:existsV:p:N_{n+1}->V.

pis path fromxtoy: <=>p_{0}=x/\p_{n}=ywheren= length(p).

Author: Wolfgang Schreiner

Last Modification: January 26, 2000