c++

data structure(graphs)

Question

implement a class that will store an unweighted directed graph using adjacency List with following functions.

-Count the out-degree of all nodes.

- Count the in-degree of all nodes.

- Print all neighboring vertices of a particular vertex.

- Check if two vertices are directly connected if their indices are provided.

Important

Using the provided graphb.txt file, test your functions and Q2.

In graphb.txt file, the first line tells youre the number of nodes in graph. Rest of the lines tell what vertices are connected

Note:

do display the output of a running program

add comments for better understanding of solution

implement all the functions

graphb.txt file will be as follows: 5007- 2 3 12 13 21 25 32 54 51 cre 5