Paths in Directed Graphs
lA path
in a graph G is a list of nodes n0, n1, É, nk such that each successive pair (ni,
ni+1)
is in the corresponding binary relation.
a
b
c
d
e
lSome
paths:
la, b, d
lc, e, a
la, c, e, a, c, d