:Lab Exercises $.5$

:Exercise $2$

Implement the directed graph below using the DiGraphAsMatrix

class and test the following methods:

Display the vertices of the graph $($use the Enumeration $.1$

interface and the getVertices$()$method

Display the edges of the graph $($use the Enumeration $.2$

interface and the getEdges$()$method

Pre order traversal starting from vertex $2\mathrm{.}3$

Post order traversal starting from vertex $1\mathrm{.}4$

Breadth$-$First Traversal starting form vertex $0\mathrm{.}5$

Check if the graph is connected $\mathrm{.}6$

Check if the graph is cyclic $\mathrm{.}7$

Check if the graph is strongly connected $\mathrm{.}8$