Question: Dijkstra's Algorithm Please show me how to code this figure above in JAVA using Dijkstra's algorithm. This is a short version of a bigger project

Dijkstra's Algorithm
Please show me how to code this figure above in JAVA using Dijkstra's algorithm. This is a short version of a bigger project I need to complete, so having this as a reference would be extremely useful. The 2 numbers next to each directed line is the cost and the time to go to each airport. I need to figure out how to find the shortest path from Dallas to Houston using time and from Dallas to Chicago using cost. Please help
23day hicago 15 Austin
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
