Examples of BerthPath

Examples of org.onebusaway.uk.network_rail.gtfs_realtime.graph.RawGraph.BerthPath

248
249
250
251
252
253
254
255
256
257
258
          if (path.size() <= 2) {
            break;
          }
          Collections.reverse(path);
          BerthPath berthPath = new BerthPath(path, currentNode.getDistance());
          double d = fromLocation.getDistance(toLocation);
          if (d > 30000) {
            continue;
          }
          RailwayPath railwayPath = _railwayShapeService.getPath(
View Full Code Here

Examples of org.onebusaway.uk.network_rail.gtfs_realtime.graph.RawGraph.BerthPath

302
303
304
305
306
307
308
309
310
311
312
      }
      _log.info("from=" + stanoxNode + " to=" + nearbyStanoxNode + " distance="
          + distance);
      _log.info(p.lat + " " + p.lon + " " + pTo.lat + " " + pTo.lon);

      BerthPath berthPath = getShortestPathBetweenNodes(stanoxNode,
          nearbyStanoxNode, distance);
      if (berthPath != null) {
        _log.info("railway path");
        RailwayPath railwayPath = _railwayShapeService.getPath(p.getPoint(),
            pTo.getPoint());
View Full Code Here

Examples of org.onebusaway.uk.network_rail.gtfs_realtime.graph.RawGraph.BerthPath

321
322
323
324
325
326
327
328
329
330
331
      RawStanoxNode toStanoxNode, double distance) {
    double maxTime = (distance * 1.5 /* meters */) / (50 /* m/s */);
    Min<BerthPath> minPath = new Min<RawGraph.BerthPath>();
    for (RawBerthNode fromNode : fromStanoxNode.getBerthConnections()) {
      for (RawBerthNode toNode : toStanoxNode.getBerthConnections()) {
        BerthPath path = _graph.getShortestPath(fromNode, toNode, maxTime);
        if (path != null) {
          minPath.add(path.distance, path);
        }
      }
    }
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. All rights reserved.
All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.