IN C++ please

Problem: Given a directed weighted graph, write a program to generate single source shortest paths based on Dijkstras algorithm.

Inputs: 1.The edges and their associated weights of a weighted graph are stored in an external text file, where each line is of the following format:The first line is a pair of integers, V and E, denoting the number of vertices and edgesof the graph. Followed by lines denoting the edges of the graph.

V E // V an integer denoting number of vertices and E denoting number of edges

vi vj wij // where vi and vj are integers and wij is a real number // the direction is from vi to vj2.

Interactive inputs: your program should start with the following menu. (1) Open input files.// prompt the user to enter a file name. (2) Source for shortest paths.//Prompt to enter a source vertex denoted by an integer in the range of 1 to |V|(3) Paths from A to B. (Bonus: 15pts) Ask user to enter verticesA and B, then list all paths and thetotal distancefor // each path, from A to B.(4) Quit.

Outputs: Print to screen the following results:Print vertices of each shortest path and its distance from the source.

Testing: create your testing data files