Table 4.
Average computational time (seconds/pair) for finding 380 pathway routes
depth | BF | MH | LP |
---|---|---|---|
0-1 | 1534 | 27.9 | 0.872 |
0-2 | 52.1 | 0.255 | 0.0325 |
0-3 | 0.0240 | 0.0314 | 0.0310 |
This table shows the computational time for each heuristic and each representation-depth to search for the shortest paths in the DDT pathway.
(BF: breadth-first search, MH: MH heuristic, LP: LP heuristic.)