# Question: how do you create a weighted directed graph using adjacency...

###### Question details

How do you create a weighted directed graph using adjacency list in c++? It should include methods of adding and removing nodes, depth first and breadth first traversals, computing a tree rooted by the given vertex, and pre-order, in-order and post-order traversals of the tree. It should also include methods that calculate the indegree and outdegree of the vertex and obtain the neighbors of the vertex The method should include its method structure. I'm just missing the method structures of pre-order, in-order and post-order traversals of the tree. It should also include methods that calculate the indegree and outdegree of the vertex as well as getting the second order of neighbors. the depth first and breadth first traversals are also missing thanks!