Please help me to understand how to do this using. Dijkstra algorithm in python. Thank you.

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: vertex