Without using the library functions, please. (in C++ programming)

Implement a program that inputs a weighted directed graph and finds the shortest path between two given vertices of this graph. Use the programing language of your choice. Your program must read a graph from a given file, prompt the user to specify two vertices, and output the shortest path between them. The format of the graph encoding is as follows: Each line encodes an edge, which points from the first to the second vertex, and the weight of this edge. The vertices of the graph are denoted by natural numbers, which may not be consecutive; for example, the vertex numbers may be 0,2 , and 8 . All edge weights are positive, and they are also encoded by natural numbers. For example, the following graph consists of three vertices (denoted 0,2 , and 8) and four edges: 022.82515 8010 8220 Problem 3 on Assignment 1 involves writing a program to solve the shortest path problem on a graph. In order to illustrate this problem further, sample file and graph are provided here