Implemented Tarjan's algorithm for removing dead-end nodes.

 - Previous two pass algorithm didn't work in all cases.
 - Tarjan's is a single pass, and ~2x the speed.
Merge pull request #235 from rodneyodonnell/master

Implemented Tarjan's algorithm for removing dead-end nodes. Replacing old two-pass algorithm.
tools: switch to normal routing
cgiar: try to improve read speed
deleted accidentally added index.html
fixing integration tests as bike was used instead bike2
fixed bug mentioned in comment of #135
merged #158, introducing edge-based algorithms, minor fixes
make turn costs possible, fixed bug in getRestrictionAsEntries, costs vs. restriction, unit tests for most of the cases
FastestWeighting.calcWeight is now in seconds, easier to include other weighting factors
merged master
moving turnCost property into encoder instead encodingmanager
fixed bug in OSMTurnRelation and created tests for this