Go backward to
Go up to Top
Go forward to Path Properties
Definition: A path is a sequence of nodes connected by edges:
p is path in G : <=> (exists n in N>0: p: Nn -> V /\ forall i in Nn-1: <pi, pi+1> in E) where V=G0, E=G1.
The length of a path is the number of edges it contains:
A path from x to y has initial node x and terminal node y
length(p) := such n in N: exists V: p: Nn+1 -> V.
p is path from x to y : <=> p0 = x /\ pn = y where n = length(p).