Fleet setup

Drivers: 6 Pending ride requests: 6 City size: 24 km across

Streaming

Stream speed: 1.0×

Assignment view

Live totals

Matrix size—

Hungarian total distance—

Greedy total distance—

Improvement over greedy—

Hungarian solve time—

Requests streamed0

The cost matrix is built from real Euclidean pickup distances between every driver and every pending request. The Hungarian (Kuhn–Munkres) algorithm below runs the genuine O(n³) primal-dual shortest-augmenting-path method — real row/column reduction via potentials, not a random or greedy guess — to find the true minimum-cost assignment. It is compared live against a naive "nearest available driver first" greedy matcher on the exact same matrix.

Driver Pending rider Hungarian assignment (optimal) Greedy assignment (nearest-first)