new SPPRCLabelSettingAlgorithm()
SPPRC Label Setting Algorithm
Extends
Members
(inner) logger :Logger
the logger instance
Type:
(inner) replayHistory :Array
Replay Stack, speichert alle Schritte des Ablaufs für Zurück Button
Type:
- Array
(inner) s :Object
status variables
Type:
- Object
(inner) that :SPPRCLabelSettingAlgorithm
closure for this class
Type:
Methods
activate()
When Tab comes into view
addReplayStep()
add a step to the replay stack, serialize stateful data
deactivate()
tab disappears from view
edgeText()
Displays in the middle of the edge (typically cost/resource vectors or capacity/flow)
- Inherited From:
- Source:
filter()
discard strictly dominated labels in both P and U
init()
Initialisiert das Zeichenfeld
nextStepChoice()
Executes the next step in the algorithm
nodeLabel()
Displays inside of a node (typically its id)
- Overrides:
- Source:
nodeText()
Displays on top of a node (typically constraints or state variables)
- Inherited From:
- Source:
nodeX()
X Position of a node
- Inherited From:
- Source:
nodeY()
Y Position of a node
- Inherited From:
- Source:
onEdgesEntered()
Called when new edges are entering
- Overrides:
- Source:
onEdgesUpdated()
Called when exisitng edges are updated
- Overrides:
- Source:
onNodesEntered()
Called when new nodes are entering
- Overrides:
- Source:
onNodesUpdated()
Called when exisitng nodes are updated
- Overrides:
- Source:
previousStepChoice()
playback the last step from stack, deserialize stateful data
reset()
clear all states
selectSource()
select the source node
update()
Makes the view consistent with the state
- Overrides:
- Source:
updateDescriptionAndPseudocode()
updates status description and pseudocode highlight based on current s.id
updateEdges()
D3's Data Join of edge data with their visualization (lines)
- Inherited From:
- Source:
updateNodes()
D3's Data Join of node data with their visualization (circles)
- Inherited From:
- Source:
(inner) dominance()
discard strictly dominated labels in both P and U
(inner) initLabels()
init the label queue / sets with the
(inner) labelProcessed()
put processed label in P
(inner) mainLoop()
main loop: pops the current node from the queue until empty
(inner) pathExtend()
try to extend currentLabel along currentArc
(inner) pathExtendFeasible()
Check if the previous label extension was feasible.
if yes, put it in U, else discard it