(via ajoinf (via ajoinf step (via ajo) (via bordo (via ajoinf step (via ajo) (via danza (via ajo) (via danzafigure following step in the shortest-path algorithm the 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 thatbecause 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 ajo-danza-colina-erizo routeyou update your notebook accordinglyas shown in table and figure table step agents in ajobordodanzaand colina from ajo to bordo colina danza erizo step (via ajoinf (via ajoinf step (via ajo) (via bordo (via ajoinf step (via ajo) (via danza (via ajo) (via danzastep (via ajo) (via danza) (via ajo) (via colina