weighted graphs the third agentin danza at this pointthe cheapest route you know that goes from ajo to any town without an agent is $ the direct route from ajo to danza both the ajo-bordo-colina route at $ and the ajo-bordo-danza route at $ are more expensive you hire another passerby and send her to danzawith an $ ticket she reports that from danza it' $ to colina and $ to erizo now you can modify your entry for colina beforeit was $ from ajogoing via bordo now you see you can reach colina for only $ going via danza alsoyou now know fare from ajo to the previously unknown erizoit' $ via danza you note these changesas shown in table and figure $ $ $ $ $ $ $ $ figure following step in the shortest-path algorithm table step agents at ajobordoand danza from ajo tobordo colina danza erizo step step step (via ajo (via ajo) (via ajo)inf (via bordo (via danza (via ajo (via ajo (via ajo)inf inf (via danzathe fourth agentin colina now the cheapest path to any town without an agent is the $ trip from ajo to colinagoing via danza accordinglyyou dispatch an agent over this route to colina he reports that it' $ from there to erizo now you can calculate thatsince colina is $ from ajo (via danza)and erizo is $ from colinayou can reduce the minimum ajo-to-erizo fare from $ (the ajo-danza-erizo routeto $ (the