1. In graph theory, a sequence of vertices in an undirected graph where each consecutive pair of vertices is connected by an edge, with no direction specified on the edges
In an undirected path, you can traverse between connected vertices in either direction.
Em um caminho não direcionado, você pode percorrer entre vértices conectados em qualquer direção.
2. A route or sequence of connected nodes in a network graph without specifying directional flow
The algorithm finds all undirected paths between two nodes in the network.
O algoritmo encontra todos os caminhos não direcionados entre dois nós na rede.