Q$2$ Categories of Graph $(6$ marks$)$

In ECE$-108,$ we defined the type of a path through a graph to be a list of edges.

An alternative representation of a path is a list of nodes.

Q$2$a List of nodes wins $(3$ marks$)$

For what kind$($s$)$ of graph would there be an advantage in choosing a path to be a list of nodes rather than a list of

edges? $($For full marks, you must justify your answer$)$

Q$2$b List of edges wins $(3$ marks$)$

For what kind$($s$)$ of graph would there be an advantage in choosing a path to be a list of edges rather than a list of

nodes? $($For full marks, you must justify your answer$)$