/** * Calculates the distance and time of the specified edgeId. Also it adds the edgeId to the path list. * * @param prevEdgeId here the edge that comes before edgeId is necessary. I.e. for the reverse search we need the * next edge. */ protected void processEdge(int edgeId, int adjNode, int prevEdgeId) { EdgeIteratorState iter = graph.getEdgeIteratorState(edgeId, adjNode); distance += iter.getDistance(); time += weighting.calcMillis(iter, false, prevEdgeId); addEdge(edgeId); }
/** * Calculates the distance and time of the specified edgeId. Also it adds the edgeId to the path list. * * @param prevEdgeId here the edge that comes before edgeId is necessary. I.e. for the reverse search we need the * next edge. */ protected void processEdge(int edgeId, int adjNode, int prevEdgeId) { EdgeIteratorState iter = graph.getEdgeIteratorState(edgeId, adjNode); distance += iter.getDistance(); time += weighting.calcMillis(iter, false, prevEdgeId); addEdge(edgeId); }
/** * Calls getDistance and adds the edgeId. */ protected void processEdge(int edgeId, int adjNode, int prevEdgeId) { EdgeIteratorState iter = graph.getEdgeIteratorState(edgeId, adjNode); distance += iter.getDistance(); time += weighting.calcMillis(iter, false, prevEdgeId); addEdge(edgeId); }
/** * Calls getDistance and adds the edgeId. */ protected void processEdge( int edgeId, int adjNode ) { EdgeIteratorState iter = graph.getEdgeIteratorState(edgeId, adjNode); double dist = iter.getDistance(); distance += dist; time += calcMillis(dist, iter.getFlags(), false); addEdge(edgeId); }