Lets consider n cities c1, c2, c3,..., cn. One can travel from a city to another city through a one-way bridge. Furthermore, assume that there are no cycles generated by the bridges (even in between two cities). Thus, we have a directed acyclic graph, where vertices represent cities and directed edges represent one-way bridges. Give an efficient algorithm to find the longest sequence of cities that one can travel to. Note that you are not given a city to start with; the algorithm should rather return a longest sequence of cities that is possible to travel to.