Question

Whether there is a path in the directed graph in Exercise 16 beginning at the first vertex given and ending at the second vertex given.

Short answer

There is a path.

Step-by-step solution

Given data

Given data is \(e,c\).

Concept used of closure property

The closure of a relation \(R\) with respect to property \(P\) is the relation obtained by adding the minimum number of ordered pairs to \(R\) to obtain property \(P\).

Draw the path

\(e,a,b,c\) is a path from e to \(c\), because the directed graph contains \((e,a),(a,b)\) and \((b,c)\).