Property-testing a matcher: recompute leg time from graph edges independently
When property-testing a routing/matching planner, don't reuse the matcher's own feasibility helpers to validate its output. Instead sum edge durations along the returned route node list, add (serviceEnd - arrival) for each stop to capture waiting plus handling, and assert finish == departure + driving + service; then derive extra time against the baseline trip duration. This catches under-counted travel after dropoff or waiting at pickup. Gotcha: looking up edges with edges.find(from,to) silently picks the first edge if the graph has parallel edges, so build a Map keyed by from->to and assert uniqueness. For incremental re-matching with frozen existing plans, edit only the employees those plans don't use, or the frozen plans become invalid by design.