{
  "context": "Evaluates how well the solution leverages h3's directed edge APIs to build ordered edges between neighboring cells, recover their endpoints, and surface direction-aware edge boundaries while enforcing adjacency and resolution rules. Scoring emphasizes using the library's edge construction, validation signals, and geometry helpers rather than manual equivalents.",
  "type": "weighted_checklist",
  "checklist": [
    {
      "name": "Neighbor enforcement",
      "description": "Rejects non-adjacent or mismatched-resolution pairs by relying on h3 adjacency/resolution signals (e.g., are_neighbor_cells or catching H3NotNeighborsError/H3ResMismatchError raised by cells_to_directed_edge) before returning edges or by translating those failures into ValueError as specified.",
      "max_score": 25
    },
    {
      "name": "Ordered edge creation",
      "description": "Builds each edge with h3.cells_to_directed_edge in the same order as the provided destination list, producing package edge identifiers instead of manual tuples or coordinate pairs.",
      "max_score": 25
    },
    {
      "name": "Endpoint decoding",
      "description": "Maps edges back to endpoints using h3.directed_edge_to_cells or get_directed_edge_origin/get_directed_edge_destination rather than carrying original cells forward.",
      "max_score": 25
    },
    {
      "name": "Directional boundaries",
      "description": "Retrieves every edge's boundary with h3.directed_edge_to_boundary and ensures the coordinate sequence follows the edge direction (start anchored to the origin side, reverse edges produced with reversed order).",
      "max_score": 25
    }
  ]
}