CODE IN C++ 1. Implement a directed and weighted labeled graph. With std::vector> edges. The graph s

[answerhappygod]

CODE IN C++
1. Implement a directed and weighted labeled graph.
With std::vector<std::vector<double>>
edges. The graph should have all the functionalities similar
to those of the unweighted labeled graph. Additionally, the
graph class should have a function to print the
entire edges table. (This is different from
the print() with depth-first and with breadth-first.)
2. Add two functions to the class in part 1 to implement
Dijkstra's shortest-distance and shortest-path algorithms.