Write pseudo-code to modify Dijkstra algorithm to find the shortest path with the least number of hops. Demonstrate your approach to find that shortest path from vertex 1 to vertex 7 in the following graph. Show your work. 1 1 2 8 1 4 3 3 5 5 4 4

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.