Runtime Comparison
==================
:Author:   Thomas Gummerer
:Email:    t.gummerer@gmail.com
:Date:     8 May 2013

Comparison between the old Isochrone algorithm without any caching of
the prepared statements and the new Isochrone algorithm with caching
of the prepared statements.  All tests were executed five times and
the respectively best timing was used.

BZ network
----------

.Parameters
* Nodes of interest: 2000500
* Maximal duration: 61min (=3660sec)
* Walking speed: 1.0(m/s)
* Latest arrival time: 2011-05-10 10:10
* Travel Mode: MULTIMODAL

[options="header"]
|===================================
| BZ  | Dijkstra | MineX   | MrneX
| old | 930 ms   | 1854 ms | 1001 ms
| new | 895 ms   | 1198 ms | 967 ms
|===================================

IT network
----------

.Parameters
* Nodes of interest: 21
* Maximal duration: 661min (=39660sec)
* Walking speed: 1.0(m/s)
* Latest arrival time: 2011-09-20 15:00
* Travel Mode: MULTIMODAL

[options="header"]
|======================================
| IT  | Dijkstra | MineX     | MrneX
| old | 46678 ms | 453762 ms | 51068 ms
| new | 43591 ms | 174196 ms | 42581 ms
|======================================

Generation
----------

The times for the new algorithm were generated using the RunSimple
class. (See link:runSimple.html[RunSimple])