20 package tutorial.programming.example21tutorialTUBclass.leastCostPath;
22 import java.util.ArrayList;
57 ArrayList<Node> nodes =
new ArrayList<Node>();
58 ArrayList<Link> links =
new ArrayList<Link>();
60 nodes.add(network.
getNodes().get(Id.createNodeId(13)));
62 nodes.add(network.
getNodes().get(Id.createNodeId(14)));
63 nodes.add(network.
getNodes().get(Id.createNodeId(25)));
64 nodes.add(network.
getNodes().get(Id.createNodeId(36)));
65 nodes.add(network.
getNodes().get(Id.createNodeId(47)));
70 links.add(network.
getLinks().get(Id.createLinkId(112)));
71 links.add(network.
getLinks().get(Id.createLinkId(213)));
72 links.add(network.
getLinks().get(Id.createLinkId(224)));
73 links.add(network.
getLinks().get(Id.createLinkId(235)));
77 return new Path(nodes,links,0.0,0.0);
Map< Id< Node >,?extends Node > getNodes()
MatsimClassRouter(Network network, TravelDisutility travelCosts, TravelTime travelTimes)
Path calcLeastCostPath(Node fromNode, Node toNode, double starttime, Person person, Vehicle vehicle)
Map< Id< Link >,?extends Link > getLinks()