If there is a greedy algorithm that will traverse a graph, selecting the largest node value at each point until it reaches a leaf of the graph, what path will the greedy algorithm follow in the graph below?
Your answer seems reasonable.
Find out if you're right!