Compare algorithms

Live comparison

One clock, 2 traces

Shared stateReady

0 / 2 traces complete2 routes foundLowest observed cost: 8

Lane 01Event 1

O((V + E) log V)Guaranteed optimal

Current eventInitialize

Initialize the search from n-0-0 to n-4-4.

Nonvisual result summary

The algorithm's compatibility requirements were validated, so the reported route is optimal.

Route: A1 → B1 → C1 → D1 → E1 → E2 → E3 → E4 → E5

Current event: Initialize the search from n-0-0 to n-4-4.

Lane 02Event 1

O((V + E) log V) worst caseOptimal if admissible

Current eventInitialize

Initialize the search from n-0-0 to n-4-4.

Nonvisual result summary

This route is optimal if the selected, scaled heuristic is admissible for the current cost model.

Route: A1 → B1 → C1 → D1 → E1 → E2 → E3 → E4 → E5

Current event: Initialize the search from n-0-0 to n-4-4.