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
FastestWeighting.calcWeight is now in seconds, easier to include other weighting factors
added contributor
found minor bug in measurement
updated to latest leaflet 0.7.3 as there was a bug when releasing drag outside of map
trying to reduce memory usage of LocationIndexTree. no System.gc call in preparationCH
bug in DijkstraOneToMany fixed #239
minor test rename
minor test rename
web ui: fixing bug if only one point
web: force script update
improved docs for LocationIndex and QueryGraph
included astarbiCH in integration tests again
More robust error check in Path
disabled type=jsonp by default, security improvement