Task$($s$)$ to the done $($Data Structure $->$ Graph$)$ using C$++$

Generate the following graph on the right side. Weights of the edges are given. But add the vertexes in alphabetical order from A$,$ do not do it randomly.

Add the following function in the Graph class to check if there is an edge between two vertices:

bool edgeExists$($VertexType x$,$ VertexType y$)$

Verify if an edge exists between vertices $E$ and $F,$ and print the weight of that edge.

Use Breadth First Search to find if there is a path from $A$ to $F,$ print the path if it exists.

Use Depth First Search to find if there is a path from $G$ to $H,$ print the path if it exists.

Use Breadth First Search to find if there is a path from $D$ to $B,$ print the path if it exists.

Use Depth First Search to find if there is a path from $A$ to $C,$ print the path if it exists.