Recently, Bob had an interview with Google. Unfortunately, he didn't get the job, as he answered incorrectly some algorithmic questions. Here is one of them:
Given a graph with 50 nodes and 109 edges representing the states in the US and their respective borders. The task is to find the paths with the lowest number of node-states from Oklahoma to every other state. Which algorithm will solve the given task faster?
Bob wished he had learned more about shortest path algorithms. Luckily, you know more than Bob on this topic. What should be the correct answer?