Graph Theory, Algorithms, Data Structures, Computer Science, Machine Learning.
when you take a different route that gives you a cheaper cost or a more efficient time-frame. For example, starting from node C in the graph above, what would be the cheapest or quickest edge to get to another node. Would it be node 5, 6 or 4? It would be 4, of course. This shows that you are