| Package | Description |
|---|---|
| org.opentrafficsim.core.network |
Classes that build a network with nodes, links, and cross-sections.
|
| org.opentrafficsim.core.network.animation |
Animation for Links, Lanes, Nodes.
|
| org.opentrafficsim.core.network.lane |
Classes that provide detailed cross-sections of a link using lanes, markers and sensors.
|
| org.opentrafficsim.core.network.route |
Routes and route probabilities.
|
| Modifier and Type | Class and Description |
|---|---|
class |
OTSNode
The Node is a point with an id.
|
| Modifier and Type | Method and Description |
|---|---|
Node |
OTSLink.getEndNode() |
Node |
Link.getEndNode() |
Node |
OTSNetwork.getNode(String nodeId) |
Node |
Network.getNode(String nodeId) |
Node |
OTSLink.getStartNode() |
Node |
Link.getStartNode() |
| Modifier and Type | Method and Description |
|---|---|
Map<String,Node> |
OTSNetwork.getNodeMap() |
Map<String,Node> |
Network.getNodeMap() |
| Modifier and Type | Method and Description |
|---|---|
void |
OTSNetwork.addNode(Node node) |
void |
Network.addNode(Node node) |
boolean |
OTSNetwork.containsNode(Node node) |
boolean |
Network.containsNode(Node node) |
Link |
OTSNetwork.getLink(Node node1,
Node node2)
Find a link between node1 and node2 and return it if it exists in the network.
|
Link |
Network.getLink(Node node1,
Node node2)
Find a link between node1 and node2 and return it if it exists in the network.
|
Set<Route> |
OTSNetwork.getRoutesBetween(Node nodeFrom,
Node nodeTo) |
Set<Route> |
Network.getRoutesBetween(Node nodeFrom,
Node nodeTo) |
Route |
OTSNetwork.getShortestRouteBetween(Node nodeFrom,
Node nodeTo) |
Route |
Network.getShortestRouteBetween(Node nodeFrom,
Node nodeTo) |
void |
OTSNetwork.removeNode(Node node) |
void |
Network.removeNode(Node node) |
| Constructor and Description |
|---|
OTSLink(String id,
Node startNode,
Node endNode,
OTSLine3D designLine)
Construct a new link with infinite capacity.
|
OTSLink(String id,
Node startNode,
Node endNode,
OTSLine3D designLine,
DoubleScalar.Abs<FrequencyUnit> capacity)
Construct a new link.
|
| Constructor and Description |
|---|
NodeAnimation(Node node,
OTSSimulatorInterface simulator) |
| Constructor and Description |
|---|
CrossSectionLink(String id,
Node startNode,
Node endNode,
OTSLine3D designLine)
Construction of a link.
|
CrossSectionLink(String id,
Node startNode,
Node endNode,
OTSLine3D designLine,
DoubleScalar.Abs<FrequencyUnit> capacity)
Construction of a link.
|
| Modifier and Type | Method and Description |
|---|---|
Node |
Route.destinationNode() |
Node |
Route.getNode(int i) |
Node |
RouteNavigator.lastVisitedNode() |
Node |
CompleteRouteNavigator.lastVisitedNode() |
Node |
CompleteLaneBasedRouteNavigator.lastVisitedNode() |
Node |
RouteNavigator.nextNodeToVisit()
This method does not advance the route pointer.
|
Node |
CompleteRouteNavigator.nextNodeToVisit()
This method does not advance the route pointer.
|
Node |
CompleteLaneBasedRouteNavigator.nextNodeToVisit()
This method does not advance the route pointer.
|
Node |
Route.originNode() |
Node |
RouteNavigator.visitNextNode()
This method does advance the route pointer (if possible).
|
Node |
CompleteRouteNavigator.visitNextNode()
This method does advance the route pointer (if possible).
|
Node |
CompleteLaneBasedRouteNavigator.visitNextNode()
This method does advance the route pointer (if possible).
|
| Modifier and Type | Method and Description |
|---|---|
List<Node> |
Route.getNodes() |
| Modifier and Type | Method and Description |
|---|---|
void |
Route.addNode(Node node)
Add a node to the end of the node list.
|
void |
CompleteRoute.addNode(Node node)
Add a node to the end of the node list.
|
boolean |
Route.contains(Node node) |
int |
Route.indexOf(Node node)
Return the index of a Node in this Route, or -1 if this Route does not contain the specified Node.
|
| Constructor and Description |
|---|
CompleteRoute(String id,
List<Node> nodes)
Create a route based on an initial list of nodes.
|
Route(String id,
List<Node> nodes)
Create a route based on an initial list of nodes.
|
Copyright © 2014–2015 Delft University of Technology. All rights reserved.