1. In graph theory and mathematics, a path in a directed graph where each edge has an associated direction, and the path follows the direction of the edges
In the oriented path from vertex A to vertex B, we must follow the direction of each edge.
No caminho orientado do vértice A ao vértice B, devemos seguir a direção de cada aresta.
2. A sequence of vertices connected by directed edges where the direction of traversal is specified
An oriented path in a directed acyclic graph cannot contain cycles.
Um caminho orientado em um grafo acíclico direcionado não pode conter ciclos.