|
|||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||||
Interface of a navigation.
| Method Summary | |
void |
addOrderBehind(ExtendedOrder eo,
TaskPlanInterface plan,
int lastBeforePlan,
int curTime)
Adds the order to the taskplan after the current tasks of the taskplan, at least after the last station before useable tasks. |
void |
addOrderTo(ExtendedOrder eo,
TaskPlanInterface plan,
int lastBeforePlan,
int curTime)
Adds the order to the taskplan after the last station before useable tasks. |
GraphEdge |
getEdge(GraphNode start,
GraphNode dest)
Returns the execution graph edge between start and destination. |
GraphNode |
getLast(TaskPlanInterface plan,
int lastBeforePlan)
Gets the last station on route if the the taskplan isn't empty else the last station before useable tasks. |
GraphNode |
getNode(int stationId)
Returns the execution graph node with the station id. |
TaskPlanInterface |
getShortestBetween(GraphNode start,
GraphNode dest,
de.upb.swtpra.kernel.id.OrderID id,
GraphEdge not)
Returns the shortest taskplan between start and destination without use of edge dontUse. |
TaskPlanInterface |
getShortestBetween(GraphNode start,
GraphNode dest,
de.upb.swtpra.kernel.id.OrderID id,
GraphEdge not,
boolean roundAbout,
int curTime)
|
| Method Detail |
public void addOrderTo(ExtendedOrder eo,
TaskPlanInterface plan,
int lastBeforePlan,
int curTime)
throws java.lang.Exception
eo - The order to be added to the taskplanplan - The taskplan to add the tasks for the order tolastBeforePlan - The station to add the tasks for the order aftercurTime -
java.lang.Exception
java.lang.Exception - Thrown if there isn't a path to add the order
public void addOrderBehind(ExtendedOrder eo,
TaskPlanInterface plan,
int lastBeforePlan,
int curTime)
throws java.lang.Exception
eo - The feature to be added to the OrderBehindRoute attributeplan - The feature to be added to the OrderBehindRoute attributelastBeforePlan - The feature to be added to the OrderBehindRoute attributecurTime -
java.lang.Exception
java.lang.Exception - Exception description not provided
public TaskPlanInterface getShortestBetween(GraphNode start,
GraphNode dest,
de.upb.swtpra.kernel.id.OrderID id,
GraphEdge not)
throws java.lang.Exception
start - The start node of the returned taskplandest - The destination node of the returned taskplanid - The order id that will be used to add tasks to the returned
taskplannot - The edge that don't will be contained in the returned
taskplan.
java.lang.Exception - An Exception will be thrown if no path exists.
public TaskPlanInterface getShortestBetween(GraphNode start,
GraphNode dest,
de.upb.swtpra.kernel.id.OrderID id,
GraphEdge not,
boolean roundAbout,
int curTime)
throws java.lang.Exception
start - The start node of the returned taskplandest - The destination node of the returned taskplanid - The order id that will be used to add tasks to the returned
taskplannot - The edge that don't will be contained in the returned
taskplan.roundAbout - choose the roundabout routes that are already disabledcurTime - the current time
java.lang.Exceptionpublic GraphNode getNode(int stationId)
stationId - The station id of the node
public GraphEdge getEdge(GraphNode start,
GraphNode dest)
start - The start node of returned edgedest - The destination node of returned edge
public GraphNode getLast(TaskPlanInterface plan,
int lastBeforePlan)
plan - The taskplan to get the last station fromlastBeforePlan - The station before useable tasks will be returned in case of
empty taskplan
|
|||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||||