result.add(new Position(fromRNode.getLat(), fromRNode.getLon()));
for (int i = 1; i < locs.size()
&& !CancelableThread.currIsCanceled(); i++) {
MapNode toRNode = mapData.getNearestWayNode(new Position(locs
.get(i)), wayFilter);
HeuristicFunction hf = createHeuristicFunction(toRNode,
waySelection);
Problem problem = createProblem(fromRNode, toRNode, mapData,
wayFilter, ignoreOneways, waySelection);
Search search = new AStarSearch(new GraphSearch(), hf);
List<Action> actions = search.search(problem);