Nodo Caminos más cortos

The Shortest Edge Paths node finds paths along mesh edges to a selection of end vertices. The cost used to define «shortest» can be set to anything. By default there is a constant cost for every edge, but a typical input would be the length of each edge.

The output is encoded with vertex indices, and is meant to be used on the vertex domain. For each vertex, the Next Vertex Index output gives the index of the following vertex in the path to the «closest» endpoint.

The node is implemented with Dijkstra’s algorithm.

Truco

The edge length is a natural input to the Edge Cost. It can be implemented with the Nodo Vértices de borde and the Nodo Operar (vectores) set to the Distance operation.

Ver también

This node can be used with the Nodo Camino de bordes a selección or the Nodo Camino de bordes a curvas to generate new geometry based on the paths.

Entradas

Vértice final

A selection of the goal vertices that terminate the edge paths.

Costo del borde

The weight for each edge, used to determine the meaning of «shortest.»

Propiedades

Este nodo no contiene propiedades.

Salidas

Identificador del vértice siguiente

The following vertex on the shortest path from every vertex to the closest endpoint (as defined by the cost input).

Costo total

The remaining cost before an end vertex is reached.