1. In graph theory, a sequence of vertices where each consecutive pair is connected by a directed edge, and the edges have a specified direction or orientation.
In a directed path from vertex A to vertex C through B, each edge has an arrow indicating the direction of traversal.
Em um caminho direcionado do vértice A para C passando por B, cada aresta possui uma seta indicando a direção do percurso.
2. A route or sequence with a specific direction or orientation that cannot be reversed without following the edges in the opposite direction.
The algorithm found a directed path from the source node to the destination node.
O algoritmo encontrou um caminho direcionado do nó de origem para o nó de destino.