Method reconstructPath

packages/graph/src/Steps.ts:5266–5297

* Reconstruct the path from the previous map.

(
    target: Vertex<any, any>,
    previous: Map<ElementId, { vertex: Vertex<any, any>; edge: Edge<any, any> } | null>,
    totalWeight?: number,
  )

   * Reconstruct the path from the previous map.
   */
  private reconstructPath(
    target: Vertex<any, any>,
    previous: Map<ElementId, { vertex: Vertex<any, any>; edge: Edge<any, any> } | null>,
    totalWeight?: number,
  ): ShortestPathResult {
    const vertices: Vertex<any, any>[] = [];
    const edges: Edge<any, any>[] = [];

    let current: Vertex<any, any> | null = target;

    while (current !== null) {
      vertices.unshift(current);
      const prev = previous.get(current.id);
      if (prev === null || prev === undefined) {
        break;
      }
      edges.unshift(prev.edge);
      current = prev.vertex;
    }

    const result: ShortestPathResult = {
      vertices,
      edges,
      length: edges.length,
    };

    if (totalWeight !== undefined) {
      result.weight = totalWeight;
    }

    return result;
  }

  /**
   * Get neighboring vertices based on direction.