I just need help with dijkstras algorithm function. Im using an adjacency list or edge list, if that helps.

Final Project 1) Write a program that will implement a weighted graph and use Dijkstra's Algorithm to calculate the shortest path from a start node to every other node in the graph. You may implement your graph using an edge list, adjacency list, or adjacency matrix structure. Your program must provide the user with a prompt to allow the user to construct the graph. T he prompt should provide 6 commands: add node, adde edge, remove edge, remove node, Dijkstra, exit. a. add node -Remove an edge from the graph that starts at from' and goes to to'. If that edge does not exist then display a message to the user to indicate that the operation could not be completed d. remove node label> Remove a node from the list that is labeled with 'label The node should not be able to be removed unless it has not edges going to or leaving from it. If the node does not exist or can not be removed display a message to tell the user why the operation could not be completed. e. dijkstra label Execute Dijkstra's algorithm as discussed in class. Label will be the label of the node to start from. If that node does not exist display a message to the user informing them that the operation could not be completed. Once Dijkstra's algorithm has run you should display the nodes in the graph in order from closest to farthest starting from the source node