1. In graph theory, a path between two vertices that contains the maximum number of edges or has the greatest total weight among all possible paths in a graph
Finding the longest path in a directed acyclic graph is an important computational problem.
Encontrar o caminho mais longo em um grafo acíclico direcionado é um problema computacional importante.
2. The route or sequence with the maximum distance or duration connecting two points
The longest path through the city takes two hours by car.
O caminho mais longo pela cidade leva duas horas de carro.