// Example of AI-generated code
function calculateOptimalPath(graph: Graph, start: Node, end: Node): Path {
  // Implementation of A* algorithm
  const openSet = new PriorityQueue<Node>();
  const cameFrom = new Map<Node, Node>();
  const gScore = new Map<Node, number>();
  const fScore = new Map<Node, number>();

  // Initialize data structures
  openSet.push(start);
  gScore.set(start, 0);
  fScore.set(start, heuristicCost(start, end));

  while (!openSet.isEmpty()) {
    const current = openSet.pop();
    if (current === end) {
      return reconstructPath(cameFrom, current);
    }

    // Process neighbors
    for (const neighbor of graph.neighbors(current)) {
      // Calculate tentative gScore
      const tentativeGScore = gScore.get(current)! +
                             distanceBetween(current, neighbor);

      if (!gScore.has(neighbor) || tentativeGScore < gScore.get(neighbor)!) {
        // This path is better than any previous one
        cameFrom.set(neighbor, current);
        gScore.set(neighbor, tentativeGScore);
        fScore.set(neighbor, tentativeGScore + heuristicCost(neighbor, end));

        if (!openSet.contains(neighbor)) {
          openSet.push(neighbor);
        }
      }
    }
  }

  // No path found
  return null;
}