Index
All Classes and Interfaces|All Packages|Constant Field Values|Serialized Form
A
- absent - Enum constant in enum class it.univr.di.labeledvalue.ALabel.State
-
Not present.
- ABSENT - Static variable in class it.univr.di.labeledvalue.Literal
-
On 2017-10-27, using VisualVM, it was shown that representing the state values of a literal using an enum consumes a lot of memory in this kind of application.
- AbstractComponent - Class in it.univr.di.cstnu.graph
-
Abstract component as a base class for nodes and edges.
- AbstractComponent() - Constructor for class it.univr.di.cstnu.graph.AbstractComponent
-
Minimal constructor.
- AbstractComponent(Component) - Constructor for class it.univr.di.cstnu.graph.AbstractComponent
-
Constructor to clone the component.
- AbstractComponent(String) - Constructor for class it.univr.di.cstnu.graph.AbstractComponent
-
Creates a component with name
n
if not null, otherwise with a unique name "c<int>". - AbstractCSTN<E> - Class in it.univr.di.cstnu.algorithms
-
Core class to represent and DC check Conditional Simple Temporal Network (CSTN) where the edge weights are signed integers.
- AbstractCSTN() - Constructor for class it.univr.di.cstnu.algorithms.AbstractCSTN
-
Default constructor.
- AbstractCSTN(TNGraph<E>) - Constructor for class it.univr.di.cstnu.algorithms.AbstractCSTN
-
Initialize the CSTN using 'graph'.
- AbstractCSTN(TNGraph<E>, int) - Constructor for class it.univr.di.cstnu.algorithms.AbstractCSTN
-
Initialize the CSTN using 'graph'.
For saving the resulting graph in a file during/after a check, fieldAbstractCSTN.fOutput
must be set. - AbstractCSTN.CheckAlgorithm - Enum Class in it.univr.di.cstnu.algorithms
-
Only for stating which kind of DC checking algorithms have been implemented so far.
- AbstractCSTN.CSTNCheckStatus - Class in it.univr.di.cstnu.algorithms
-
Represents the status of a CSTN-checking algorithm during an execution.
- AbstractCSTN.DCSemantics - Enum Class in it.univr.di.cstnu.algorithms
-
Value for dcSemantics
- AbstractCSTN.EdgesToCheck<E> - Class in it.univr.di.cstnu.algorithms
-
A simple class to maintain the set of edges to check in the following phase.
- AbstractCSTN.NodesToCheck - Class in it.univr.di.cstnu.algorithms
-
Acts as a queue and a set.
- AbstractEdge - Class in it.univr.di.cstnu.graph
-
Base class for implementing LabeledIntEdge.
- AbstractEdge() - Constructor for class it.univr.di.cstnu.graph.AbstractEdge
-
Minimal constructor.
- AbstractEdge(Edge) - Constructor for class it.univr.di.cstnu.graph.AbstractEdge
-
Creates a new edge cloning
e
if not null. - AbstractEdge(String) - Constructor for class it.univr.di.cstnu.graph.AbstractEdge
-
Creates an edge with name
n
and typeEdge.ConstraintType.requirement
. - AbstractLabeledIntMap - Class in it.univr.di.labeledvalue
-
Abstract class for
LabeledIntMap
interface. - AbstractLabeledIntMap() - Constructor for class it.univr.di.labeledvalue.AbstractLabeledIntMap
- AbstractNode - Class in it.univr.di.cstnu.graph
-
Base class for implementing Node.
- AbstractNode() - Constructor for class it.univr.di.cstnu.graph.AbstractNode
-
Minimal constructor.
- AbstractNode(Node) - Constructor for class it.univr.di.cstnu.graph.AbstractNode
-
Constructor to clone the component.
- AbstractNode(String) - Constructor for class it.univr.di.cstnu.graph.AbstractNode
-
Simplified constructor
- ActivationDistanceInfo(int, int, int, int) - Constructor for record class it.univr.di.cstnu.algorithms.STNU.ActivationDistanceInfo
-
Creates an instance of a
ActivationDistanceInfo
record class. - activationNode - Variable in class it.univr.di.cstnu.algorithms.CSTNPSU
-
Utility map that returns the activation time point (node) associated with a contingent link given the contingent time point, i.e., contingent link A ===> C determines the entry (C, A) in this map.
- activationNode - Variable in class it.univr.di.cstnu.algorithms.CSTNU
-
Utility map that returns the activation time point (node) associated with a contingent link given the contingent time point, i.e., contingent link A ===> C determines the entry (C, A) in this map.
- activationNode - Variable in class it.univr.di.cstnu.algorithms.OSTNU
-
Utility map that returns the activation time point (node) associated with a contingent link, given the contingent timepoint, i.e., contingent link A ===> C determines the entry (C, A) in this map.
- activationNode() - Method in record class it.univr.di.cstnu.algorithms.STNURTE.ContingentLink
-
Returns the value of the
activationNode
record component. - ActiveWaits - Class in it.univr.di.cstnu.util
-
Active wait for a timepoint.
- ActiveWaits() - Constructor for class it.univr.di.cstnu.util.ActiveWaits
- add(int, STNU.STNUPath) - Method in class it.univr.di.cstnu.algorithms.STNU.STNUPath
-
Adds at the position the given path
- add(E, LabeledNode, LabeledNode, LabeledNode, TNGraph<E>, boolean) - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN.EdgesToCheck
-
Check if the edge that has to be added has one endpoint, which is an observer.
- add(STNU.STNUPath) - Method in class it.univr.di.cstnu.algorithms.STNU.STNUPath
-
Adds to the end of this path the given path.
- add(LabeledNode) - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN.NodesToCheck
- add(STNUEdge) - Method in class it.univr.di.cstnu.algorithms.STNU.STNUPath
-
Adds to the end of this path the edge
- add(K) - Method in class it.univr.di.cstnu.util.ObjectArrayFIFOSetQueue
- add(T) - Method in class it.univr.di.cstnu.util.ObjectPair
- addAll(Collection<? extends LabeledNode>) - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN.NodesToCheck
- addAll(Collection<? extends K>) - Method in class it.univr.di.cstnu.util.ObjectArrayFIFOSetQueue
- addAll(Collection<? extends T>) - Method in class it.univr.di.cstnu.util.ObjectPair
- addAll(Collection<E>) - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN.EdgesToCheck
-
Add a set of edges without any checks.
- addChildToObserverNode(LabeledNode, char) - Method in class it.univr.di.cstnu.graph.TNGraph
-
Add child to obs.
- addChildToObserverNode(LabeledNode, char) - Method in class it.univr.di.cstnu.graph.TNGraph.UnmodifiableTNGraph
-
Unsupported.
- addEdge(E, Pair<? extends LabeledNode>) - Method in class it.univr.di.cstnu.graph.TNGraph
-
Unsupported
- addEdge(E, Pair<? extends LabeledNode>, EdgeType) - Method in class it.univr.di.cstnu.graph.TNGraph
- addEdge(E, LabeledNode, LabeledNode) - Method in class it.univr.di.cstnu.graph.TNGraph
-
Adds the edge if there is no edge between v1 and v2.
- addEdge(E, LabeledNode, LabeledNode) - Method in class it.univr.di.cstnu.graph.TNPredecessorGraph
-
Adds the edge to this graph.
- addEdge(E, LabeledNode, LabeledNode, EdgeType) - Method in class it.univr.di.cstnu.graph.TNGraph
- addEdge(E, String, String) - Method in class it.univr.di.cstnu.graph.TNGraph
-
Optimized method for adding an edge.
- addEdge(E, Collection<? extends LabeledNode>) - Method in class it.univr.di.cstnu.graph.TNGraph
-
Unsupported
- addEdge(E, Collection<? extends LabeledNode>, EdgeType) - Method in class it.univr.di.cstnu.graph.TNGraph
-
Unsupported
- addEdge(K, Pair<? extends LabeledNode>, EdgeType) - Method in class it.univr.di.cstnu.graph.TNGraph.UnmodifiableTNGraph
-
Unsupported.
- addEdge(K, LabeledNode, LabeledNode) - Method in class it.univr.di.cstnu.graph.TNGraph.UnmodifiableTNGraph
-
Unsupported.
- addEdge(K, LabeledNode, LabeledNode, EdgeType) - Method in class it.univr.di.cstnu.graph.TNGraph.UnmodifiableTNGraph
-
Unsupported.
- addEdge(K, String, String) - Method in class it.univr.di.cstnu.graph.TNGraph.UnmodifiableTNGraph
-
Unsupported.
- addEdgeWithoutCheck(E, String, String) - Method in class it.univr.di.cstnu.graph.TNGraph
-
Optimized method for adding an edge without any security check and listener modification for edges.
- addNegativeScenario(Label) - Method in class it.univr.di.cstnu.algorithms.OSTNU.OSTNUCheckStatus
-
Adds to negative scenarios the label, maintaining the minimal representation of the scenarios.
- addNode(LabeledNode) - Method in class it.univr.di.cstnu.graph.TNPredecessorGraph
-
Adds 'node' to the set of nodes.
- addObserver(String, PropertyChangeListener) - Method in class it.univr.di.cstnu.graph.AbstractComponent
-
An observer for the property.
- addUpperBounds() - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN
-
The upper bounds from Z to each node have to be set after the horizon is determined.
- addVertex(LabeledNode) - Method in class it.univr.di.cstnu.graph.TNGraph
-
Adds the given vertex to the graph.
- addVertex(LabeledNode) - Method in class it.univr.di.cstnu.graph.TNGraph.UnmodifiableTNGraph
-
Unsupported.
- addVertexWithoutCheck(LabeledNode) - Method in class it.univr.di.cstnu.graph.TNGraph
-
Adds the given vertex to the graph without checking its previous presence and without adding any listeners to it.
- addWait(LabeledNode, int) - Method in class it.univr.di.cstnu.util.ActiveWaits
-
Add an active wait represented as (Contingent, positive value) to the queue.
- agileControllabilityCheck() - Method in class it.univr.di.cstnu.algorithms.OSTNU
-
Checks the agile controllability (AC) of the given network (see
OSTNU(TNGraph)
orAbstractCSTN.setG(TNGraph)
). - aLabel - Variable in class it.univr.di.cstnu.graph.BasicCSTNUEdgePluggable.InternalEntry
- ALabel - Class in it.univr.di.labeledvalue
-
Simple class to represent a ALabel in the CSTNU framework.
- ALabel(ALabelAlphabet) - Constructor for class it.univr.di.labeledvalue.ALabel
-
Default constructor using a given alphabet.
- ALabel(ALabelAlphabet.ALetter, ALabelAlphabet) - Constructor for class it.univr.di.labeledvalue.ALabel
-
Builds an ALabel using the ALetter 'l' and 'alphabet'.
- ALabel(String, ALabelAlphabet) - Constructor for class it.univr.di.labeledvalue.ALabel
-
Helper constructor.
- ALABEL_RE - Static variable in class it.univr.di.labeledvalue.ALabel
-
Regular expression representing an ALabel.
- ALABEL_SEPARATOR - Static variable in class it.univr.di.labeledvalue.ALabel
-
ALabel separator '∙'.
- ALABEL_SEPARATORstring - Static variable in class it.univr.di.labeledvalue.ALabel
-
ALabel separator '∙'.
- ALabel.EmptyLabel - Class in it.univr.di.labeledvalue
-
An unmodifiable empty label.
- ALabel.State - Enum Class in it.univr.di.labeledvalue
-
Possible state of a
ALabelAlphabet.ALetter
in an alphabetic label. - ALabelAlphabet - Class in it.univr.di.labeledvalue
-
A customizable alphabet, where elements are strings.
- ALabelAlphabet() - Constructor for class it.univr.di.labeledvalue.ALabelAlphabet
-
Default constructor.
- ALabelAlphabet(int) - Constructor for class it.univr.di.labeledvalue.ALabelAlphabet
- ALabelAlphabet(ALabelAlphabet) - Constructor for class it.univr.di.labeledvalue.ALabelAlphabet
-
Constructor by copy.
- ALabelAlphabet.ALetter - Class in it.univr.di.labeledvalue
-
ALetter makes it simpler to check if a node name is appropriate.
- aLabelSet() - Method in class it.univr.di.labeledvalue.LabeledALabelIntTreeMap
- ALetter(String) - Constructor for class it.univr.di.labeledvalue.ALabelAlphabet.ALetter
- ALETTER - Static variable in class it.univr.di.labeledvalue.ALabelAlphabet
-
ALetter.
- ALETTER_RANGE - Static variable in class it.univr.di.labeledvalue.ALabelAlphabet
-
ALetter range.
- all - Enum constant in enum class it.univr.di.cstnu.algorithms.STNU.STNUCheckStatus.SRNCEdges
-
ordinary lower- and upper-case
- allComponentsOfBaseGenerator(char[]) - Static method in class it.univr.di.labeledvalue.Label
-
A base is a set of labels of the same length that can be used to build any other label of greater length in the universe.
- AllPairsShortestPaths - Enum constant in enum class it.univr.di.cstnu.algorithms.STN.CheckAlgorithm
-
All-Pairs-Shortest-Paths
- alreadyAddAllIncidentsToZ - Variable in class it.univr.di.cstnu.algorithms.AbstractCSTN.EdgesToCheck
- alreadyRepresents(Label, int) - Method in class it.univr.di.labeledvalue.LabeledIntHierarchyMap
- alreadyRepresents(Label, int) - Method in interface it.univr.di.labeledvalue.LabeledIntMap
- alreadyRepresents(Label, int) - Method in class it.univr.di.labeledvalue.LabeledIntSimpleMap
-
Deprecated.
- alreadyRepresents(Label, int) - Method in class it.univr.di.labeledvalue.LabeledIntTreeMap
- alreadyRepresents(Label, ALabel, int) - Method in class it.univr.di.labeledvalue.LabeledALabelIntTreeMap
- AND - Static variable in class it.univr.di.cstnu.util.CSTNU2UppaalTiga
-
Token to represent logic AND in Tiga expression.
- applyFastDispatchSTNU(boolean) - Method in class it.univr.di.cstnu.algorithms.STNU
-
The FD_STNU algorithm is used to check the DC of the network and make it dispatchable (if DC).
- applyMinDispatchableESTNU(boolean) - Method in class it.univr.di.cstnu.algorithms.STNU
-
Makes the current DC network dispatchable removing all the dominated edges (ordinaries or waits).
- applyMorris2014() - Method in class it.univr.di.cstnu.algorithms.STNU
-
Morris's 2014 algorithm to check the dynamic controllability of an STNU.
- applyMorris2014Dispatchable() - Method in class it.univr.di.cstnu.algorithms.STNU
-
Morris's 2014 algorithm to check the dynamic controllability (DC) of an STNU.
- applyNormalForm() - Method in class it.univr.di.cstnu.algorithms.STNU
-
The equivalent normal form of the distance graph associated with an STNU.
- applyR0R3(CSTNEdge, LabeledNode, LabeledNode) - Method in class it.univr.di.cstnu.algorithms.CSTN
-
Applies R0 and R3 to the edge AB.
- applyRul2018() - Method in class it.univr.di.cstnu.algorithms.STNU
-
RUL^- algorithm by Cairo, Hunsberger, and Rizzi, presented in Faster dynamic controllability checking for simple temporal networks with uncertainty at TIME 2018.
- applyRul2021() - Method in class it.univr.di.cstnu.algorithms.STNU
-
Luke Hunsberger version of RUL- algorithm.
- applySRNCycleFinder() - Method in class it.univr.di.cstnu.algorithms.STNU
-
It is the RUL2021 algorithm that also returns the negative cycle in case the instance is not DC.
- approximatingSTNU - Variable in class it.univr.di.cstnu.algorithms.PSTN.PSTNCheckStatus
-
DC STNU obtained setting contingent link bounds such that the conjunct probability mass is
PSTN.PSTNCheckStatus.probabilityMass
. - APSP_FloydWarshall(TNGraph<E>, STN.STNCheckStatus) - Static method in interface it.univr.di.cstnu.util.GraphAlgs
-
Determines the minimal distance between all pairs of nodes (all-pair-shortest-paths (APSP)) using the Floyd-Warshall algorithm.
- APSP_Johnson(TNGraph<E>, Object2IntMap<LabeledNode>, STN.STNCheckStatus) - Static method in interface it.univr.di.cstnu.util.GraphAlgs
-
Determines the minimal distance between all pairs of nodes (all-pair-shortest-paths (APSP)) using the Johnson algorithm.
- APSP_Johnson(TNGraph<E>, STN.STNCheckStatus) - Static method in interface it.univr.di.cstnu.util.GraphAlgs
-
Determines the minimal distance between all pairs of nodes (all-pair-shortest-paths (APSP)) using the Johnson algorithm.
- APSP_Johnson(GraphDistances, Object2IntMap<LabeledNode>) - Static method in interface it.univr.di.cstnu.util.GraphAlgs
-
Determines the minimal distance between all pairs of nodes (all-pair-shortest-paths (APSP)) using the Johnson algorithm.
- areComplement(char, char) - Static method in class it.univr.di.labeledvalue.Literal
B
- backingArray - Variable in class it.univr.di.cstnu.util.ObjectArrayFIFOSetQueue
-
The backing array.
- BannisterEppstein - Enum constant in enum class it.univr.di.cstnu.algorithms.STN.CheckAlgorithm
- base - Variable in class it.univr.di.labeledvalue.LabeledIntTreeMap
-
A set of propositions forming a base for the labels of the map.
- BASE_DIR_NAME - Static variable in class it.univr.di.cstnu.util.CSTNRandomGenerator
-
Name of the root directory
- BASE_DIR_NAME - Static variable in class it.univr.di.cstnu.util.OSTNURandomGenerator
-
Name of the root directory
- BASE_DIR_NAME - Static variable in class it.univr.di.cstnu.util.STNURandomGenerator
-
Name of the root directory
- baseDirName - Variable in class it.univr.di.cstnu.util.OSTNURandomGenerator
-
Base directory for saving the random instances.
- baseDirName - Variable in class it.univr.di.cstnu.util.STNURandomGenerator
-
The base directory is used to save random instances.
- BasicCSTNUEdge - Interface in it.univr.di.cstnu.graph
-
Represents the common behavior of an edge that can have upper-case value(s) and a lower-case one.
- BasicCSTNUEdgePluggable - Class in it.univr.di.cstnu.graph
-
An abstract implementation of BasicCSTNUEdge where the type to represent the labeled value set can be plugged during the creation.
- BasicCSTNUEdgePluggable(Edge) - Constructor for class it.univr.di.cstnu.graph.BasicCSTNUEdgePluggable
- BasicCSTNUEdgePluggable(Edge, Class<? extends LabeledIntMap>) - Constructor for class it.univr.di.cstnu.graph.BasicCSTNUEdgePluggable
- BasicCSTNUEdgePluggable(String) - Constructor for class it.univr.di.cstnu.graph.BasicCSTNUEdgePluggable
- BasicCSTNUEdgePluggable(String, Class<? extends LabeledIntMap>) - Constructor for class it.univr.di.cstnu.graph.BasicCSTNUEdgePluggable
- BasicCSTNUEdgePluggable.InternalEntry - Class in it.univr.di.cstnu.graph
-
Represents a pair (Label, String).
- BellmanFord - Enum constant in enum class it.univr.di.cstnu.algorithms.STN.CheckAlgorithm
-
Bellman-Ford
- BellmanFordSingleSink - Enum constant in enum class it.univr.di.cstnu.algorithms.STN.CheckAlgorithm
-
Bellman-Ford
- BFCT - Enum constant in enum class it.univr.di.cstnu.algorithms.STN.CheckAlgorithm
-
SSSP_BFCT
- buildAPairRndCSTNInstances(boolean) - Method in class it.univr.di.cstnu.util.CSTNRandomGenerator
-
Builds a pair of DC and non-DC of CSTN instances using the building parameters.
- buildApproxSTNU() - Method in class it.univr.di.cstnu.algorithms.PSTN
-
Determines
(Su, F)
, where Su = (T, C, L) is a dynamically controllable STNU where L = {(Ai, xi, yi, Ci) | i ∈ {1, ..., k}} and F is the value of the objective function (i.e., the joint probability mass of the probabilistic durations in this PSTN network captured by the contingent links in L). - buildRenderContext(VisualizationViewer<LabeledNode, E>, boolean) - Method in class it.univr.di.cstnu.visualization.TNEditor
-
Adds vertex and edge renders, tooltips, and mouse behavior to a viewer.
C
- caseLabel - Variable in class it.univr.di.cstnu.graph.STNUEdgeInt
-
The upper/lower case label.
- CaseLabel(STNUEdge.CaseLabel) - Constructor for class it.univr.di.cstnu.graph.STNUEdge.CaseLabel
- CaseLabel(ALabelAlphabet.ALetter, boolean) - Constructor for class it.univr.di.cstnu.graph.STNUEdge.CaseLabel
-
A lower/upper-case label.
- ccLoop - Enum constant in enum class it.univr.di.cstnu.algorithms.STNU.STNUCheckStatus.SRNCKind
-
A negative cycle was found solving a CC loop because the LC can be bypassed.
- ccLoop - Variable in class it.univr.di.cstnu.algorithms.STNU.RULLocalInfo
-
CCLoop is true if the loop 'C' to 'C' has length < Delta_C
- charValue(int) - Static method in class it.univr.di.labeledvalue.Literal
- check(char) - Static method in class it.univr.di.labeledvalue.Literal
- CHECK_ACTIVATION_UNIQUENESS(LabeledNode, LabeledNode, Object2ObjectMap<LabeledNode, LabeledNode>) - Static method in class it.univr.di.cstnu.algorithms.STNU
-
Checks if the activation node is already an activation node for another contingent node.
- checkAlgorithm - Variable in class it.univr.di.cstnu.algorithms.STNU.STNUCheckStatus
-
The algorithm was used to check the network last time.
- checkAndManageIfNewLabeledValueIsANegativeLoop(int, LabeledNode, LabeledNode, BasicCSTNUEdge, AbstractCSTN.CSTNCheckStatus) - Static method in class it.univr.di.cstnu.algorithms.CSTNU
-
Just to check if a new labeled value is negative, its label has no unknown literals, and it is in a self-loop.
- checkAndManageIfNewLabeledValueIsANegativeLoop(int, Label, LabeledNode, LabeledNode, OSTNUEdgePluggable) - Method in class it.univr.di.cstnu.algorithms.OSTNU
-
Checks if a new labeled value is negative and represents a negative cycle.
- checkedGraph - Variable in class it.univr.di.cstnu.visualization.TNEditor
-
Necessary TNGraph structure to represent the derived graph.
- Checker - Class in it.univr.di.cstnu.util
-
Simple class to determine the average execution time (and standard dev) of the (C)STN(U) DC checking algorithm on a given set of (C)STN(U)s.
- Checker() - Constructor for class it.univr.di.cstnu.util.Checker
- Checker.GlobalStatisticKey - Class in it.univr.di.cstnu.util
-
Utility internal class to store #contingent, #nodes, and #propositions and allows the ordering among objects of this class.
- checkGuardedLinkBounds(LabeledNode, LabeledNode, CSTNPSUEdge, CSTNPSUEdge, AbstractCSTN.CSTNCheckStatus) - Static method in class it.univr.di.cstnu.algorithms.CSTNPSU
-
A ---(u, alpha)---> C ---(v, beta)---> A If u+v < 0, raise the non-controllability status of the guarded link.
- checkingAlgCSTNComboBox - Variable in class it.univr.di.cstnu.visualization.TNEditor
-
Drop-down list for selecting CSTN Checking Algorithm
- checkModifiers(MouseEvent) - Method in class it.univr.di.cstnu.visualization.CSTNUGraphAttributeEditingMousePlugin
- checkModifiers(MouseEvent) - Method in class it.univr.di.cstnu.visualization.EditingGraphMousePlugin
-
Overridden to be more flexible, and pass events with key combinations.
- checkStatus - Variable in class it.univr.di.cstnu.algorithms.AbstractCSTN
-
Check status
- checkStatus - Variable in class it.univr.di.cstnu.algorithms.OSTNU
-
Agile status
- checkStatus - Variable in class it.univr.di.cstnu.algorithms.STN
-
Check status
- checkTimeOutAndAdjustStatus(Instant) - Method in class it.univr.di.cstnu.algorithms.STN.STNCheckStatus
-
If current instant is after the
timeoutInstant
, it adjusts this object setting to truetimeout
and to falseconsistency, finished
. - checkWellDefinitionProperties() - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN
-
checkWellDefinitionProperties.
- checkWellDefinitionProperty1and3(LabeledNode, LabeledNode, E, boolean) - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN
-
Checks whether the constraint represented by an edge 'e' satisfies the well-defined first property (WD1): any labeled value of the edge has a label that subsumes both labels of the two endpoints. In case a label is not WD1 and
hasToBeFixed
, then it is fixed. - checkWellDefinitionProperty1and3(LabeledNode, LabeledNode, CSTNUEdge, boolean) - Method in class it.univr.di.cstnu.algorithms.CSTNU
-
Calls and then checks upper and lower case values.
- checkWellDefinitionProperty2(LabeledNode, boolean) - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN
-
Checks whether the label of a node satisfies the well-defined second property (WD2): For each literal present in a node label: The label of the observation node of the considered literal is subsumed by the label of the current node.
- choice(STNURTE.NodeEnabledInTimeInterval) - Method in interface it.univr.di.cstnu.algorithms.STNURTE.NodeAndExecutionTimeChoice
- cleanCheckedInstance - Variable in class it.univr.di.cstnu.algorithms.AbstractCSTN
-
If true, after a check, the resulting graph is cleaned: all empty edges or labeled values containing unknown literals are removed.
- cleanCheckedInstance - Variable in class it.univr.di.cstnu.algorithms.STN
- cleanResult - Variable in class it.univr.di.cstnu.visualization.TNEditor
-
Cleaned result.
- clear() - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN.EdgesToCheck
-
Clear the set.
- clear() - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN.NodesToCheck
-
Clear the set.
- clear() - Method in class it.univr.di.cstnu.algorithms.STNU.STNUPath
-
Clear the current path.
- clear() - Method in class it.univr.di.cstnu.graph.AbstractComponent
- clear() - Method in class it.univr.di.cstnu.graph.BasicCSTNUEdgePluggable
- clear() - Method in interface it.univr.di.cstnu.graph.Component
-
Clear all components but the name.
- clear() - Method in class it.univr.di.cstnu.graph.CSTNEdgePluggable
-
Clear all components but the name.
- clear() - Method in class it.univr.di.cstnu.graph.CSTNPSUEdgePluggable
- clear() - Method in class it.univr.di.cstnu.graph.CSTNUEdgePluggable
- clear() - Method in class it.univr.di.cstnu.graph.LabeledNode
-
Clears all fields but name.
- clear() - Method in class it.univr.di.cstnu.graph.STNEdgeInt
- clear() - Method in class it.univr.di.cstnu.graph.STNUEdgeInt
- clear() - Method in class it.univr.di.cstnu.graph.TNGraph
-
Clear all internal structures.
- clear() - Method in class it.univr.di.cstnu.graph.TNGraph.UnmodifiableTNGraph
-
Makes this graph empty.
- clear() - Method in class it.univr.di.cstnu.graph.TNPredecessorGraph
-
Clear all structures.
- clear() - Method in class it.univr.di.cstnu.util.ExtendedPriorityQueue
-
Makes the queue empty.
- clear() - Method in class it.univr.di.cstnu.util.ObjectArrayFIFOSetQueue
- clear() - Method in class it.univr.di.cstnu.util.ObjectPair
- clear() - Method in class it.univr.di.labeledvalue.ALabel
-
Makes the label empty.
- clear() - Method in class it.univr.di.labeledvalue.ALabelAlphabet
-
Cleans the map.
- clear() - Method in class it.univr.di.labeledvalue.LabeledALabelIntTreeMap
- clear() - Method in class it.univr.di.labeledvalue.LabeledIntHierarchyMap
- clear() - Method in class it.univr.di.labeledvalue.LabeledIntHierarchyMap.HierarchyNode
-
Clear all internal objects, making them empty.
- clear() - Method in interface it.univr.di.labeledvalue.LabeledIntMap
-
Remove all entries from the map.
- clear() - Method in interface it.univr.di.labeledvalue.LabeledIntMap.LabeledIntMapView
- clear() - Method in class it.univr.di.labeledvalue.LabeledIntSimpleMap
-
Deprecated.
- clear() - Method in class it.univr.di.labeledvalue.LabeledIntTreeMap
- clear(int) - Method in class it.univr.di.cstnu.graph.TNGraph
-
Clear all internal structures.
- clear(int) - Method in class it.univr.di.cstnu.graph.TNGraph.UnmodifiableTNGraph
-
Unsupported
- clearCache() - Method in class it.univr.di.cstnu.graph.TNGraph
-
Clear all internal caches.
- clearCache() - Method in class it.univr.di.cstnu.graph.TNGraph.UnmodifiableTNGraph
-
Unsupported.
- clearLowerCaseValue() - Method in interface it.univr.di.cstnu.graph.BasicCSTNUEdge
-
Clears the labeled lowercase values.
- clearLowerCaseValue() - Method in class it.univr.di.cstnu.graph.CSTNPSUEdgePluggable
- clearLowerCaseValue() - Method in class it.univr.di.cstnu.graph.CSTNUEdgePluggable
- clearLowerCaseValues() - Method in interface it.univr.di.cstnu.graph.CSTNPSUEdge
-
Clears the labeled lowercase values.
- clearLowerCaseValues() - Method in class it.univr.di.cstnu.graph.CSTNPSUEdgePluggable
- clearPotential() - Method in class it.univr.di.cstnu.graph.LabeledNode
-
Clears all fields about potential values.
- clearPredecessors(LabeledNode) - Method in class it.univr.di.cstnu.graph.TNPredecessorGraph
-
Clears all predecessors of the given node.
- clearUpperCaseValues() - Method in interface it.univr.di.cstnu.graph.BasicCSTNUEdge
-
Clears all uppercase labeled values.
- clearUpperCaseValues() - Method in class it.univr.di.cstnu.graph.BasicCSTNUEdgePluggable
- clone(ALabel) - Static method in class it.univr.di.labeledvalue.ALabel
-
To have a correct copy of an ALabel.
- close() - Method in interface it.univr.di.cstnu.util.OptimizationEngine
-
Closes the connection to the optimization engine.
- CLOSE_PAIR - Static variable in class it.univr.di.labeledvalue.Constants
-
Char representing labeled-value closing ")".
- CLOSE_TUPLE - Static variable in class it.univr.di.labeledvalue.Constants
-
A tuple closing char
- COLLAPSE_RIGID_COMPONENT(TNGraph<E>, Object2ObjectMap<LabeledNode, LabeledNode>, Object2IntMap<LabeledNode>) - Static method in class it.univr.di.cstnu.algorithms.STN
-
Collapses are given rigid components (RC), rerouting in each RC, and all edges to/from nodes in RC to the representative node of RC.
- collapseRigidComponent(ObjectList<ObjectList<LabeledNode>>) - Method in class it.univr.di.cstnu.algorithms.STN
-
Collapses rigid components of the current STN.
- collapseRigidComponents(Object2ObjectMap<LabeledNode, LabeledNode>, Object2IntMap<LabeledNode>, ObjectSet<E>, ObjectSet<E>) - Method in class it.univr.di.cstnu.algorithms.STNU
-
Collapses given rigid components (RC) by rerouting, in each RC, all edges to/from nodes in RC to the representative node of RC.
- comparator() - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN.NodesToCheck
- comparator() - Method in class it.univr.di.cstnu.util.ObjectArrayFIFOSetQueue
-
This implementation returns
null
(FIFO queues have no comparator). - compareTo(Object2ObjectMap.Entry<Label, ALabel>) - Method in class it.univr.di.cstnu.graph.BasicCSTNUEdgePluggable.InternalEntry
- compareTo(STNU.ActivationDistanceInfo) - Method in record class it.univr.di.cstnu.algorithms.STNU.ActivationDistanceInfo
- compareTo(STNURTE.NodeWithTimeInterval) - Method in record class it.univr.di.cstnu.algorithms.STNURTE.NodeWithTimeInterval
- compareTo(Component) - Method in class it.univr.di.cstnu.graph.AbstractComponent
-
Implements the natural order of the component names.
- compareTo(Checker.GlobalStatisticKey) - Method in class it.univr.di.cstnu.util.Checker.GlobalStatisticKey
-
The order is respect to #nodes,#contingents, and #propositions.
- compareTo(ALabel) - Method in class it.univr.di.labeledvalue.ALabel
-
To speed up this method, and considering that the
ALabelAlphabet
order may not be the expected alphabetic one (the first letter in anALabelAlphabet
can be 'nodeZ' and the last one 'aNode'), the order of labels is given with respect to their indexes in theirALabelAlphabet
. - compareTo(ALabel) - Method in class it.univr.di.labeledvalue.ALabel.EmptyLabel
- compareTo(ALabelAlphabet.ALetter) - Method in class it.univr.di.labeledvalue.ALabelAlphabet.ALetter
- compareTo(Label) - Method in class it.univr.di.labeledvalue.Label
-
Determines an order based on the length of the label.
- compareTo(LabeledIntHierarchyMap.HierarchyNode) - Method in class it.univr.di.labeledvalue.LabeledIntHierarchyMap.HierarchyNode
-
* To minimize the number of insertions, it is better to have sons ordered in inverted lexicographical order.
- compareTo(Literal) - Method in class it.univr.di.labeledvalue.Literal
- Component - Interface in it.univr.di.cstnu.graph
-
Component interface.
- configureSubNetworks(ObjectList<CSTNPSU.PrototypalLink>, int) - Method in class it.univr.di.cstnu.algorithms.CSTNPSU
-
Checks if the current network can be embedded with subnetworks represented by
subNetworks
. - conjoin(ALabelAlphabet.ALetter) - Method in class it.univr.di.labeledvalue.ALabel
-
Conjoins
ALetter
to this. - conjoin(ALabelAlphabet.ALetter) - Method in class it.univr.di.labeledvalue.ALabel.EmptyLabel
- conjunction(char, char) - Method in class it.univr.di.labeledvalue.Label
-
It returns a new label conjunction of
proposition
andthis
ifthis
is consistent withproposition
and itspropositionState
. - conjunction(ALabel) - Method in class it.univr.di.labeledvalue.ALabel
-
Conjoins
ALabel
tothis
and returns the result without modifyingthis
. - conjunction(ALabel) - Method in class it.univr.di.labeledvalue.ALabel.EmptyLabel
- conjunction(Label) - Method in class it.univr.di.labeledvalue.Label
-
Conjuncts
label
tothis
ifthis
is consistent withlabel
and returns the result without modifyingthis
. - conjunction(Literal) - Method in class it.univr.di.labeledvalue.Label
-
Helper method for
Label.conjunction(char, char)
- conjunctionExtended(char, char) - Method in class it.univr.di.labeledvalue.Label
-
It returns the conjunction of
proposition
tothis
. - conjunctionExtended(Label) - Method in class it.univr.di.labeledvalue.Label
-
Create a new label that represents the conjunction of
this
andlabel
using alsoLiteral.UNKNOWN
literals. - conjunctionExtended(Literal) - Method in class it.univr.di.labeledvalue.Label
-
Helper method
Label.conjunctionExtended(char, char)
- conjunctProbabilityMass() - Method in record class it.univr.di.cstnu.util.PSTNRTEBenchmarkRunner.PSTNSituation
-
Returns the value of the
conjunctProbabilityMass
record component. - consideredLabeledValue - Variable in class it.univr.di.cstnu.graph.CSTNEdgePluggable
-
Maintains the log of labeled values that have already been inserted and, therefore, cannot be reinserted.
- consideredLowerCaseValue - Variable in class it.univr.di.cstnu.graph.CSTNPSUEdgePluggable
-
The CSTNU controllability check algorithm needs to know if a labeled value has already been considered in the past to avoid adding it a second time.
- consideredUpperCaseValue - Variable in class it.univr.di.cstnu.graph.BasicCSTNUEdgePluggable
-
The CSTNU controllability check algorithm needs to know if a labeled value has already been considered in the past to avoid adding it a second time.
- consistency - Variable in class it.univr.di.cstnu.algorithms.STN.STNCheckStatus
-
Consistency status (it is assumed true at the initialization).
- consistencyCheck() - Method in class it.univr.di.cstnu.algorithms.STN
-
Checks the consistency of this STN instance within
STN.timeOut
seconds using the algorithmSTN.getDefaultConsistencyCheckAlg()
. - consistencyCheck(STN.CheckAlgorithm) - Method in class it.univr.di.cstnu.algorithms.STN
-
Checks the consistency of this STN instance using algorithm
alg
. - Constants - Class in it.univr.di.labeledvalue
-
Some useful constants for the package.
- constraintEdgeStroke - Static variable in enum class it.univr.di.cstnu.visualization.EdgeRendering
-
Simple stroke object to draw a 'standard' type edge.
- constraintType - Variable in class it.univr.di.cstnu.graph.AbstractEdge
-
The type of the edge.
- contains(char) - Method in class it.univr.di.labeledvalue.Label
- contains(ALabel) - Method in class it.univr.di.labeledvalue.ALabel
-
L1 contains L2 if L1 contains all ALetters of L2.
- contains(ALabel) - Method in class it.univr.di.labeledvalue.ALabel.EmptyLabel
- contains(ALabelAlphabet.ALetter) - Method in class it.univr.di.labeledvalue.ALabel
- contains(ALabelAlphabet.ALetter) - Method in class it.univr.di.labeledvalue.ALabel.EmptyLabel
- contains(Literal) - Method in class it.univr.di.labeledvalue.Label
- contains(Object) - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN.NodesToCheck
- contains(Object) - Method in class it.univr.di.cstnu.util.ObjectArrayFIFOSetQueue
- contains(Object) - Method in class it.univr.di.cstnu.util.ObjectPair
- containsAll(Collection<?>) - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN.NodesToCheck
- containsAll(Collection<?>) - Method in class it.univr.di.cstnu.util.ObjectArrayFIFOSetQueue
- containsAll(Collection<?>) - Method in class it.univr.di.cstnu.util.ObjectPair
- containsEdge(E) - Method in class it.univr.di.cstnu.graph.TNGraph
- containsUnknown() - Method in class it.univr.di.labeledvalue.Label
- containsValue(ALabelAlphabet.ALetter) - Method in class it.univr.di.labeledvalue.ALabelAlphabet
- containsVertex(LabeledNode) - Method in class it.univr.di.cstnu.graph.TNGraph
- CONTINGENCY_SYMBOL - Static variable in class it.univr.di.labeledvalue.Constants
-
Char representing the contingency symbol (0x2B0D): ↕︎
- contingent - Enum constant in enum class it.univr.di.cstnu.graph.Edge.ConstraintType
-
The edge represents a contingent constraint.
- contingentAlsoAsOrdinary - Variable in class it.univr.di.cstnu.algorithms.CSTNU
-
Represent contingent links also as ordinary constraints.
- contingentAlsoAsOrdinary - Variable in class it.univr.di.cstnu.algorithms.OSTNU
-
Represent contingent links also as ordinary constraints.
- contingentAlsoAsOrdinary - Variable in class it.univr.di.cstnu.visualization.TNEditor
-
True if the contingent link is also to be represented as ordinary constraints.
- contingentEdgeStroke - Static variable in enum class it.univr.di.cstnu.visualization.EdgeRendering
-
Simple stroke object to draw a 'standard' type edge.
- ContingentLink(LabeledNode, int, int, LabeledNode) - Constructor for record class it.univr.di.cstnu.algorithms.STNURTE.ContingentLink
-
Creates an instance of a
ContingentLink
record class. - contingentNode() - Method in record class it.univr.di.cstnu.algorithms.STNURTE.ContingentLink
-
Returns the value of the
contingentNode
record component. - contingents - Variable in class it.univr.di.cstnu.util.Checker.GlobalStatisticKey
-
# contingents
- controlSouthPanel - Variable in class it.univr.di.cstnu.visualization.TNEditor
- copy(TNGraph<E>) - Method in class it.univr.di.cstnu.graph.TNGraph
-
A defensive copy of all 'g' internal structures.
- copy(TNGraph<K>) - Method in class it.univr.di.cstnu.graph.TNGraph.UnmodifiableTNGraph
-
Unsupported.
- copyCleaningRedundantLabels(TNGraph<E>) - Method in class it.univr.di.cstnu.graph.TNGraph
-
Makes a copy as
TNGraph.copy(TNGraph)
removing all labeled values having unknown literal(s) or -∞ value. - copyCleaningRedundantLabels(TNGraph<K>) - Method in class it.univr.di.cstnu.graph.TNGraph.UnmodifiableTNGraph
-
Unsupported.
- coreCSTNInitAndCheck() - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN
-
Makes the CSTN well-definedness check and initialization.
- coreSTNInitAndCheck() - Method in class it.univr.di.cstnu.algorithms.STN
-
Makes the STN check and initialization.
- count - Variable in class it.univr.di.labeledvalue.AbstractLabeledIntMap
-
The number of elements in the map
- create(ALabel, int, Label) - Static method in class it.univr.di.labeledvalue.LabeledLowerCaseValue
-
Creates a lower-case value.
- create(LabeledLowerCaseValue) - Static method in class it.univr.di.labeledvalue.LabeledLowerCaseValue
-
Copy constructor.
- crossCaseRuleCalls - Variable in class it.univr.di.cstnu.algorithms.CSTNU.CSTNUCheckStatus
-
Counts the # of applications of different rules.
- crossCaseRuleCalls - Variable in class it.univr.di.cstnu.algorithms.OSTNU.OSTNUCheckStatus
-
Counts the # of applications of different rules.
- cstn - Variable in class it.univr.di.cstnu.visualization.TNEditor
-
CSTN checker
- CSTN - Class in it.univr.di.cstnu.algorithms
-
Represents a Conditional Simple Temporal Network (CSTN), and it contains a method to check the dynamic consistency of the instance.
- CSTN - Enum constant in enum class it.univr.di.cstnu.graph.TNGraph.NetworkType
-
Conditional STN
- CSTN() - Constructor for class it.univr.di.cstnu.algorithms.CSTN
-
Default constructor.
- CSTN(TNGraph<CSTNEdge>) - Constructor for class it.univr.di.cstnu.algorithms.CSTN
-
Initialize the CSTN using a graph.
- CSTN(TNGraph<CSTNEdge>, int) - Constructor for class it.univr.di.cstnu.algorithms.CSTN
-
Initialize the CSTN using a graph.
- CSTN_CLASS - Static variable in class it.univr.di.cstnu.util.CSTNRandomGenerator
-
Checker
- CSTN2CSTN0 - Class in it.univr.di.cstnu.algorithms
-
Simple class to represent and check Conditional Simple Temporal Network, assuming epsilon semantics and reducing an instance to an appropriate CSTN where DC checking is made, assuming instantaneous reaction semantics.
- CSTN2CSTN0(int, TNGraph<CSTNEdge>) - Constructor for class it.univr.di.cstnu.algorithms.CSTN2CSTN0
- CSTN2CSTN0(int, TNGraph<CSTNEdge>, int) - Constructor for class it.univr.di.cstnu.algorithms.CSTN2CSTN0
- cstnCheckAlg - Variable in class it.univr.di.cstnu.visualization.TNEditor
-
Which check algorithm for CSTN
- CSTNCheckStatus() - Constructor for class it.univr.di.cstnu.algorithms.AbstractCSTN.CSTNCheckStatus
- cstnDCSemanticsComboBox - Variable in class it.univr.di.cstnu.visualization.TNEditor
-
semantic combo for CSTN
- CSTNEdge - Interface in it.univr.di.cstnu.graph
-
Represents the behavior of a CSTN edge.
- CSTNEdgePluggable - Class in it.univr.di.cstnu.graph
-
An implementation of CSTNEdge where the kind of labeled value map can be configured at initialization (new) time.
- CSTNEdgePluggable() - Constructor for class it.univr.di.cstnu.graph.CSTNEdgePluggable
- CSTNEdgePluggable(Edge) - Constructor for class it.univr.di.cstnu.graph.CSTNEdgePluggable
-
A simple constructor cloner.
- CSTNEdgePluggable(Edge, Class<? extends LabeledIntMap>) - Constructor for class it.univr.di.cstnu.graph.CSTNEdgePluggable
-
A simple constructor cloner.
- CSTNEdgePluggable(String) - Constructor for class it.univr.di.cstnu.graph.CSTNEdgePluggable
-
Constructor for LabeledIntEdge.
- CSTNEdgePluggable(String, Class<? extends LabeledIntMap>) - Constructor for class it.univr.di.cstnu.graph.CSTNEdgePluggable
-
Constructor for LabeledIntEdge.
- cstnEditor - Variable in class it.univr.di.cstnu.visualization.CSTNUGraphAttributeEditingMousePlugin
-
The editor in which this plugin works.
- cstnEditor - Variable in class it.univr.di.cstnu.visualization.EditingModalGraphMouse
-
Internal reference to the main JFrame.
- CSTNEpsilon - Class in it.univr.di.cstnu.algorithms
-
Simple class to represent and check Conditional Simple Temporal Network (CSTN) where the edge weights are signed integers.
- CSTNEpsilon() - Constructor for class it.univr.di.cstnu.algorithms.CSTNEpsilon
-
Default constructor.
- CSTNEpsilon(int, TNGraph<CSTNEdge>) - Constructor for class it.univr.di.cstnu.algorithms.CSTNEpsilon
-
Constructor for CSTN.
- CSTNEpsilon(int, TNGraph<CSTNEdge>, int) - Constructor for class it.univr.di.cstnu.algorithms.CSTNEpsilon
-
Constructor for CSTN.
- CSTNEpsilon3R - Class in it.univr.di.cstnu.algorithms
-
Simple class to represent and check Conditional Simple Temporal Network (CSTN) where the edge weights are signed integers.
- CSTNEpsilon3R() - Constructor for class it.univr.di.cstnu.algorithms.CSTNEpsilon3R
-
Default constructor.
- CSTNEpsilon3R(int, TNGraph<CSTNEdge>) - Constructor for class it.univr.di.cstnu.algorithms.CSTNEpsilon3R
-
Constructor for CSTN with reaction time at least epsilon and without node labels.
- CSTNEpsilon3R(int, TNGraph<CSTNEdge>, int) - Constructor for class it.univr.di.cstnu.algorithms.CSTNEpsilon3R
- CSTNEpsilon3RwoNodeLabels - Class in it.univr.di.cstnu.algorithms
-
Simple class to represent and check Conditional Simple Temporal Network (CSTN) where the edge weights are signed integers.
- CSTNEpsilon3RwoNodeLabels() - Constructor for class it.univr.di.cstnu.algorithms.CSTNEpsilon3RwoNodeLabels
-
Default constructor.
- CSTNEpsilon3RwoNodeLabels(int, TNGraph<CSTNEdge>) - Constructor for class it.univr.di.cstnu.algorithms.CSTNEpsilon3RwoNodeLabels
-
Constructor for CSTN with reaction time at least epsilon and without node labels.
- CSTNEpsilon3RwoNodeLabels(int, TNGraph<CSTNEdge>, int) - Constructor for class it.univr.di.cstnu.algorithms.CSTNEpsilon3RwoNodeLabels
- CSTNEpsilonwoNodeLabels - Class in it.univr.di.cstnu.algorithms
-
Simple class to represent and check Conditional Simple Temporal Network (CSTN) where the edge weights are signed integers.
- CSTNEpsilonwoNodeLabels() - Constructor for class it.univr.di.cstnu.algorithms.CSTNEpsilonwoNodeLabels
-
Default constructor.
- CSTNEpsilonwoNodeLabels(int, TNGraph<CSTNEdge>) - Constructor for class it.univr.di.cstnu.algorithms.CSTNEpsilonwoNodeLabels
-
Constructor for CSTN with reaction time at least epsilon and without node labels.
- CSTNEpsilonwoNodeLabels(int, TNGraph<CSTNEdge>, int) - Constructor for class it.univr.di.cstnu.algorithms.CSTNEpsilonwoNodeLabels
-
Constructor for CSTN with reaction time at least epsilon and without node labels.
- CSTNIR - Class in it.univr.di.cstnu.algorithms
-
Simple class to represent and check Conditional Simple Temporal Network (CSTN) where the edge weights are signed integers.
- CSTNIR() - Constructor for class it.univr.di.cstnu.algorithms.CSTNIR
-
Default constructor.
- CSTNIR(TNGraph<CSTNEdge>) - Constructor for class it.univr.di.cstnu.algorithms.CSTNIR
-
Constructor for CSTN.
- CSTNIR(TNGraph<CSTNEdge>, int) - Constructor for class it.univr.di.cstnu.algorithms.CSTNIR
- CSTNIR3R - Class in it.univr.di.cstnu.algorithms
-
Simple class to represent and check Conditional Simple Temporal Network (CSTN) where the edge weights are signed integers.
- CSTNIR3R() - Constructor for class it.univr.di.cstnu.algorithms.CSTNIR3R
- CSTNIR3R(TNGraph<CSTNEdge>) - Constructor for class it.univr.di.cstnu.algorithms.CSTNIR3R
- CSTNIR3R(TNGraph<CSTNEdge>, int) - Constructor for class it.univr.di.cstnu.algorithms.CSTNIR3R
- CSTNIR3RwoNodeLabels - Class in it.univr.di.cstnu.algorithms
-
Simple class to represent and check Conditional Simple Temporal Network (CSTN) where the edge weights are signed integers.
- CSTNIR3RwoNodeLabels() - Constructor for class it.univr.di.cstnu.algorithms.CSTNIR3RwoNodeLabels
-
Default constructor.
- CSTNIR3RwoNodeLabels(TNGraph<CSTNEdge>) - Constructor for class it.univr.di.cstnu.algorithms.CSTNIR3RwoNodeLabels
- CSTNIR3RwoNodeLabels(TNGraph<CSTNEdge>, int) - Constructor for class it.univr.di.cstnu.algorithms.CSTNIR3RwoNodeLabels
- CSTNIRwoNodeLabels - Class in it.univr.di.cstnu.algorithms
-
Simple class to represent and check Conditional Simple Temporal Network (CSTN) where the edge weights are signed integers.
- CSTNIRwoNodeLabels() - Constructor for class it.univr.di.cstnu.algorithms.CSTNIRwoNodeLabels
-
Default constructor.
- CSTNIRwoNodeLabels(TNGraph<CSTNEdge>) - Constructor for class it.univr.di.cstnu.algorithms.CSTNIRwoNodeLabels
-
Constructor for
- CSTNIRwoNodeLabels(TNGraph<CSTNEdge>, int) - Constructor for class it.univr.di.cstnu.algorithms.CSTNIRwoNodeLabels
- CSTNLayout - Class in it.univr.di.cstnu.visualization
-
Allows the layout of a CSTN(U) determined by transforming a workflow generated by the 'Atapis Random generator tool'.
- CSTNLayout(Graph<LabeledNode, CSTNEdge>) - Constructor for class it.univr.di.cstnu.visualization.CSTNLayout
-
Creates an instance for the specified graph and default size; vertex locations are determined by
CSTNLayout.positionInitializer
. - CSTNLayout(Graph<LabeledNode, CSTNEdge>, Dimension) - Constructor for class it.univr.di.cstnu.visualization.CSTNLayout
-
Creates an instance for the specified graph and size.
- CSTNPotential - Class in it.univr.di.cstnu.algorithms
-
Represents a Conditional Simple Temporal Network (CSTN), and it contains a method to check the dynamic consistency of the instance.
- CSTNPotential() - Constructor for class it.univr.di.cstnu.algorithms.CSTNPotential
-
Default constructor.
- CSTNPotential(TNGraph<CSTNEdge>) - Constructor for class it.univr.di.cstnu.algorithms.CSTNPotential
-
Constructor for CSTNPotential.
- CSTNPotential(TNGraph<CSTNEdge>, int) - Constructor for class it.univr.di.cstnu.algorithms.CSTNPotential
-
Constructor for CSTNPotential.
- cstnpsu - Variable in class it.univr.di.cstnu.visualization.TNEditor
-
CSTNPSU checker
- CSTNPSU - Class in it.univr.di.cstnu.algorithms
-
Represents and checks streamlined Conditional Simple Temporal Network with Partial Shrinkable Uncertainty (CSTNPSU).
- CSTNPSU - Enum constant in enum class it.univr.di.cstnu.graph.TNGraph.NetworkType
-
FTNU === CSTNPSU Conditional STN partially shrinkable uncertainty
- CSTNPSU() - Constructor for class it.univr.di.cstnu.algorithms.CSTNPSU
-
Default constructor, package use only!
- CSTNPSU(TNGraph<CSTNPSUEdge>) - Constructor for class it.univr.di.cstnu.algorithms.CSTNPSU
-
Constructor for CSTNPSU
- CSTNPSU(TNGraph<CSTNPSUEdge>, int) - Constructor for class it.univr.di.cstnu.algorithms.CSTNPSU
-
Constructor for CSTNPSU
- CSTNPSU(String) - Constructor for class it.univr.di.cstnu.algorithms.CSTNPSU
-
Helper constructor for CSTNPSU.
- CSTNPSU.PrototypalLink - Class in it.univr.di.cstnu.algorithms
-
Represents a prototypal link.
- CSTNPSUEdge - Interface in it.univr.di.cstnu.graph
-
Represents the behavior of a CSTNPSU edge.
- CSTNPSUEdgePluggable - Class in it.univr.di.cstnu.graph
-
An implementation of CSTNPSUEdge.
- CSTNPSUEdgePluggable() - Constructor for class it.univr.di.cstnu.graph.CSTNPSUEdgePluggable
-
Default constructor.
- CSTNPSUEdgePluggable(Edge) - Constructor for class it.univr.di.cstnu.graph.CSTNPSUEdgePluggable
-
Constructor to clone the component.
- CSTNPSUEdgePluggable(String) - Constructor for class it.univr.di.cstnu.graph.CSTNPSUEdgePluggable
- CSTNRandomGenerator - Class in it.univr.di.cstnu.util
-
Allows one to build random CSTN instances specifying:
- CSTNRandomGenerator(int, int, int, int, int, int, int, double, int) - Constructor for class it.univr.di.cstnu.util.CSTNRandomGenerator
- cstnStatus - Variable in class it.univr.di.cstnu.visualization.TNEditor
-
CSTN check status
- cstnu - Variable in class it.univr.di.cstnu.visualization.TNEditor
-
CSTNU checker
- CSTNU - Class in it.univr.di.cstnu.algorithms
-
Represents a Conditional Simple Temporal Network with Uncertainty (CSTNU).
- CSTNU - Enum constant in enum class it.univr.di.cstnu.graph.TNGraph.NetworkType
-
Conditional STNU
- CSTNU() - Constructor for class it.univr.di.cstnu.algorithms.CSTNU
-
Default constructor, package use only!
- CSTNU(TNGraph<CSTNUEdge>) - Constructor for class it.univr.di.cstnu.algorithms.CSTNU
-
Constructor for CSTNU
- CSTNU(TNGraph<CSTNUEdge>, int) - Constructor for class it.univr.di.cstnu.algorithms.CSTNU
-
Constructor for CSTNU
- CSTNU(TNGraph<CSTNUEdge>, int, boolean) - Constructor for class it.univr.di.cstnu.algorithms.CSTNU
-
Constructor for CSTNU
- CSTNU(String) - Constructor for class it.univr.di.cstnu.algorithms.CSTNU
-
Helper constructor for CSTNU.
- CSTNU.CSTNUCheckStatus - Class in it.univr.di.cstnu.algorithms
-
A simple class to represent the status of the checking algorithm during an execution.
- cstnu2cstn - Variable in class it.univr.di.cstnu.visualization.TNEditor
-
CSTNU2CSTN checker
- CSTNU2CSTN - Class in it.univr.di.cstnu.algorithms
-
Simple class to represent and check Conditional Simple Temporal Network with Uncertainty (CSTNU), where the DC checking is done reducing the instance to an equivalent CSTN instance where the DC checking is done assuming instantaneous reaction.
- CSTNU2CSTN() - Constructor for class it.univr.di.cstnu.algorithms.CSTNU2CSTN
-
Constructor for CSTNU2CSTN.
- CSTNU2CSTN(TNGraph<CSTNUEdge>) - Constructor for class it.univr.di.cstnu.algorithms.CSTNU2CSTN
- CSTNU2CSTN(TNGraph<CSTNUEdge>, int) - Constructor for class it.univr.di.cstnu.algorithms.CSTNU2CSTN
-
Constructor for CSTNU
- CSTNU2CSTNPSU - Class in it.univr.di.cstnu.util
-
Reads CSTNU instances and converts them into CSTNPSU (==FTNU) instances, transforming each contingent link into a guarded one.
- CSTNU2UppaalTiga - Class in it.univr.di.cstnu.util
-
Actor class that transforms a CSTNU instance into a UppaalTiga Time Game Automate schema.
- CSTNU2UppaalTiga(TNGraph<CSTNUEdge>, PrintStream) - Constructor for class it.univr.di.cstnu.util.CSTNU2UppaalTiga
-
Constructor for CSTNU2UppaalTiga.
- CSTNUCheckStatus() - Constructor for class it.univr.di.cstnu.algorithms.CSTNU.CSTNUCheckStatus
- CSTNUEdge - Interface in it.univr.di.cstnu.graph
-
Represents the behavior of a CSTNU edge.
- CSTNUEdgePluggable - Class in it.univr.di.cstnu.graph
-
An implementation of CSTNUEdge where the type to represent a labeled value set can be plugged during the creation.
- CSTNUEdgePluggable() - Constructor for class it.univr.di.cstnu.graph.CSTNUEdgePluggable
-
Internal constructor
- CSTNUEdgePluggable(Edge) - Constructor for class it.univr.di.cstnu.graph.CSTNUEdgePluggable
-
Constructor to clone the component.
- CSTNUEdgePluggable(Edge, Class<? extends LabeledIntMap>) - Constructor for class it.univr.di.cstnu.graph.CSTNUEdgePluggable
-
Constructor to clone the component.
- CSTNUEdgePluggable(String) - Constructor for class it.univr.di.cstnu.graph.CSTNUEdgePluggable
- CSTNUEdgePluggable(String, Class<? extends LabeledIntMap>) - Constructor for class it.univr.di.cstnu.graph.CSTNUEdgePluggable
- CSTNUGraphAttributeEditingMousePlugin<V,
E> - Class in it.univr.di.cstnu.visualization -
Allows editing of vertex or edge attributes.
- CSTNUGraphAttributeEditingMousePlugin(TNEditor) - Constructor for class it.univr.di.cstnu.visualization.CSTNUGraphAttributeEditingMousePlugin
-
Create an instance with default settings
- CSTNUStaticLayout<E> - Class in it.univr.di.cstnu.visualization
-
Extends CSTNUStaticLayout, retrieving initial node positions from node attributes.
- CSTNUStaticLayout(Graph<LabeledNode, E>) - Constructor for class it.univr.di.cstnu.visualization.CSTNUStaticLayout
-
Creates an instance for the specified graph and default size; vertex locations are determined by
CSTNUStaticLayout.positionInitializer
. - CSTNUStaticLayout(Graph<LabeledNode, E>, Dimension) - Constructor for class it.univr.di.cstnu.visualization.CSTNUStaticLayout
-
Creates an instance for the specified graph and size.
- cstnuStatus - Variable in class it.univr.di.cstnu.visualization.TNEditor
-
CSTNU check status
- CSTNwoNodeLabel - Class in it.univr.di.cstnu.algorithms
-
A simple class is used to represent and check a Conditional Simple Temporal Network (CSTN) where the edge weights are signed integers.
- CSTNwoNodeLabel() - Constructor for class it.univr.di.cstnu.algorithms.CSTNwoNodeLabel
-
Default constructor.
- CSTNwoNodeLabel(TNGraph<CSTNEdge>) - Constructor for class it.univr.di.cstnu.algorithms.CSTNwoNodeLabel
-
Constructor for
- CSTNwoNodeLabel(TNGraph<CSTNEdge>, int) - Constructor for class it.univr.di.cstnu.algorithms.CSTNwoNodeLabel
- CSVSep - Static variable in class it.univr.di.cstnu.util.Checker
-
CSV separator
- CSVSep - Static variable in class it.univr.di.cstnu.util.DispatchabilityBenchmarkRunner
-
CSV separator
- CSVSep - Static variable in class it.univr.di.cstnu.util.PSTNRTEBenchmarkRunner
-
CSV separator
- CSVSep - Static variable in class it.univr.di.cstnu.util.SRNCFinderBenchmarkRunner
-
CSV separator
- CSVSep - Static variable in class it.univr.di.cstnu.util.STNURTEBenchmarkRunner
-
CSV separator
- CTG_FILE_NAME_SUFFIX - Static variable in class it.univr.di.cstnu.util.STNUDensifier
-
Default instance name suffix for contingent node reduction
- cumulativeProbability(double) - Method in class it.univr.di.cstnu.util.LogNormalDistributionParameter
- current - Variable in class it.univr.di.cstnu.util.RunMeter
- currentEdgeFactory - Variable in class it.univr.di.cstnu.util.Checker
- currentEdgeImpl - Variable in class it.univr.di.cstnu.visualization.TNEditor
-
Current edge implementation class
- currentEdgeImplClass - Variable in class it.univr.di.cstnu.util.Checker
-
Class for representing an edge.
- currentEdgeImplClass - Variable in class it.univr.di.cstnu.util.CSTNU2CSTNPSU
-
Class for representing an edge.
- currentEdgeImplClass - Variable in class it.univr.di.cstnu.util.STNUDensifier
-
Class for representing an edge.
- currentTNGraphType - Variable in class it.univr.di.cstnu.visualization.TNEditor
-
The kind of network the system is currently showing
- cycle - Variable in class it.univr.di.cstnu.visualization.TNEditor
-
Number of cycles of CSTN(U) check step-by-step
- cycles - Variable in class it.univr.di.cstnu.algorithms.STN.STNCheckStatus
-
Counts the # of applications of different rules.
D
- DC_SUB_DIR_NAME - Static variable in class it.univr.di.cstnu.util.CSTNRandomGenerator
-
Name of subdirectory containing DC instances
- DC_SUB_DIR_NAME - Static variable in class it.univr.di.cstnu.util.OSTNURandomGenerator
-
Name of subdirectory containing DC instances
- DC_SUB_DIR_NAME - Static variable in class it.univr.di.cstnu.util.STNURandomGenerator
-
Name of subdirectory containing DC instances
- dcCurrentSem - Variable in class it.univr.di.cstnu.visualization.TNEditor
-
The current wanted semantics
- Debug - Enum Class in it.univr.di
-
Contains the static final boolean for enabling/disabling debug logging in all it.univr.di subpackages.
- DEFAULT_ALETTER_RET_VALUE - Static variable in class it.univr.di.labeledvalue.ALabelAlphabet
-
Default value for not found index.
- DEFAULT_BYTE_RET_VALUE - Static variable in class it.univr.di.labeledvalue.ALabelAlphabet
-
Default value for a not-found name.
- DEFAULT_CSTN_EDGE_CLASS - Static variable in class it.univr.di.cstnu.graph.EdgeSupplier
- DEFAULT_CSTNPSU_EDGE_CLASS - Static variable in class it.univr.di.cstnu.graph.EdgeSupplier
- DEFAULT_CSTNU_EDGE_CLASS - Static variable in class it.univr.di.cstnu.graph.EdgeSupplier
- DEFAULT_LABELED_INT_MAP_CLASS - Static variable in class it.univr.di.cstnu.graph.CSTNEdgePluggable
-
Default class for representing labeled values.
- DEFAULT_LABELED_INT_MAP_CLASS - Static variable in class it.univr.di.cstnu.graph.OSTNUEdgePluggable
-
Class for representing labeled values.
- DEFAULT_LABELEDINTMAP_CLASS - Static variable in class it.univr.di.labeledvalue.LabeledIntMapSupplier
- DEFAULT_OSTNU_EDGE_CLASS - Static variable in class it.univr.di.cstnu.graph.EdgeSupplier
- DEFAULT_STN_EDGE_CLASS - Static variable in class it.univr.di.cstnu.graph.EdgeSupplier
- DEFAULT_STNU_EDGE_CLASS - Static variable in class it.univr.di.cstnu.graph.EdgeSupplier
- defaultConsistencyCheckAlg - Variable in class it.univr.di.cstnu.algorithms.STN
-
Which algorithm should be used for the consistency check?
- defaultDir - Variable in class it.univr.di.cstnu.visualization.TNEditor
-
Default load/save directory
- defaultMain(String[], CSTN, String) - Static method in class it.univr.di.cstnu.algorithms.CSTN
- degree(LabeledNode) - Method in class it.univr.di.cstnu.graph.TNGraph
- delete(T) - Method in class it.univr.di.cstnu.util.ExtendedPriorityQueue
-
Removes the element if it is present in the queue.
- DENSE_FILE_NAME_SUFFIX - Static variable in class it.univr.di.cstnu.util.STNUDensifier
-
Default instance name suffix for dense transformation
- DEPTH_FIRST_ORDER(TNGraph<STNEdge>, LabeledNode, ObjectList<LabeledNode>, Object2BooleanMap<LabeledNode>, boolean) - Static method in class it.univr.di.cstnu.algorithms.STN
-
Recursive method for determining a depth-first order of nodes.
- dequeue() - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN.NodesToCheck
- dequeue() - Method in class it.univr.di.cstnu.util.ObjectArrayFIFOSetQueue
- dequeueLast() - Method in class it.univr.di.cstnu.util.ObjectArrayFIFOSetQueue
-
Dequeues the last element from the queue.
- derived - Enum constant in enum class it.univr.di.cstnu.graph.Edge.ConstraintType
-
The edge represents a constraint derived by the controllability check algorithm.
- DERIVED_GRAPH_BIG_VIEWER_NAME - Static variable in class it.univr.di.cstnu.visualization.TNEditor
-
Name of the derived graph Big Viewer
- derivedEdgeStroke - Static variable in enum class it.univr.di.cstnu.visualization.EdgeRendering
-
Simple stroke object to draw a 'derived' type edge.
- derivedGraphBiggerViewer - Variable in class it.univr.di.cstnu.visualization.TNEditor
-
Button for a bigger derived-network viewer
- Design assumptions - Search tag in class it.univr.di.labeledvalue.ALabel
- Section
- destination - Variable in class it.univr.di.cstnu.algorithms.STNU.EdgeData
- differentEdgesOf(TNGraph<E>) - Method in class it.univr.di.cstnu.graph.TNGraph
-
Returns the list of different edges of this graph from g1.
- Dijkstra - Enum constant in enum class it.univr.di.cstnu.algorithms.STN.CheckAlgorithm
-
Dijkstra
- DispatchabilityBenchmarkRunner - Class in it.univr.di.cstnu.util
-
Simple class to determine the average execution time (and standard dev) of the STN(U) dispatchability algorithms on a given set of STNUs.
- DispatchabilityBenchmarkRunner() - Constructor for class it.univr.di.cstnu.util.DispatchabilityBenchmarkRunner
- distance() - Method in record class it.univr.di.cstnu.algorithms.STNU.ActivationDistanceInfo
-
Returns the value of the
distance
record component. - DISTANCE_VIEWER_NAME - Static variable in class it.univr.di.cstnu.visualization.TNEditor
-
Name of the distance viewer panel
- distanceFromNodeToContingent - Variable in class it.univr.di.cstnu.algorithms.STNU.RULLocalInfo
-
Distance from a node to the contingent node associated with this local info.
- DistancePair(int, int) - Constructor for record class it.univr.di.cstnu.algorithms.STNU.DistancePair
-
Creates an instance of a
DistancePair
record class. - distanceWithWait() - Method in record class it.univr.di.cstnu.algorithms.STNU.ActivationDistanceInfo
-
Returns the value of the
distanceWithWait
record component. - done() - Method in class it.univr.di.cstnu.visualization.CSTNLayout
- done() - Method in class it.univr.di.cstnu.visualization.CSTNUStaticLayout
- draw(LabeledNode, double, double, TNGraph<CSTNEdge>, int) - Method in class it.univr.di.cstnu.visualization.CSTNLayout
- durationsOutOfBounds() - Method in record class it.univr.di.cstnu.util.PSTNRTEBenchmarkRunner.PSTNSituation
-
Returns the value of the
durationsOutOfBounds
record component. - dynamicConsistencyCheck() - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN
-
Checks the dynamic consistency (DC) of a CSTN instance within timeout seconds.
- dynamicConsistencyCheck() - Method in class it.univr.di.cstnu.algorithms.CSTN
- dynamicConsistencyCheck() - Method in class it.univr.di.cstnu.algorithms.CSTN2CSTN0
-
Checks the dynamic consistency (DC) of a CSTN instance within timeout seconds.
- dynamicConsistencyCheck() - Method in class it.univr.di.cstnu.algorithms.CSTNPSU
-
Checks the dynamic consistency (DC) of a CSTN instance within timeout seconds.
- dynamicConsistencyCheck() - Method in class it.univr.di.cstnu.algorithms.CSTNU
-
Checks the dynamic consistency (DC) of a CSTN instance within timeout seconds.
- dynamicConsistencyCheck() - Method in class it.univr.di.cstnu.algorithms.OSTNU
-
Checks the dynamic consistency (DC) of a CSTN instance within timeout seconds.
- dynamicConsistencyCheckWOInit() - Method in class it.univr.di.cstnu.algorithms.CSTN
-
Checks the dynamic consistency of a CSTN instance without initializing the network.
- dynamicConsistencyCheckWOInit() - Method in class it.univr.di.cstnu.algorithms.CSTNPotential
- dynamicControllabilityCheck() - Method in class it.univr.di.cstnu.algorithms.CSTNPSU
-
Checks the controllability of a CSTNPSU instance and, if the instance is controllable, determines all the minimal ranges for the constraints.
- dynamicControllabilityCheck() - Method in class it.univr.di.cstnu.algorithms.CSTNU
-
Checks the dynamic controllability (DC) of the given network (see
CSTNU(TNGraph)
orAbstractCSTN.setG(TNGraph)
). - dynamicControllabilityCheck() - Method in class it.univr.di.cstnu.algorithms.CSTNU2CSTN
-
Checks the dynamic controllability (DC) of the given network (see
CSTNU(TNGraph)
orAbstractCSTN.setG(TNGraph)
). - dynamicControllabilityCheck() - Method in class it.univr.di.cstnu.algorithms.STNU
-
Checks the consistency of an STN instance within timeout seconds.
- dynamicControllabilityCheck(STNU.CheckAlgorithm) - Method in class it.univr.di.cstnu.algorithms.STNU
-
Executes the dynamic controllability check using the specified algorithm and returns the status of the check.
E
- EARLY_EXECUTION_STRATEGY - Enum constant in enum class it.univr.di.cstnu.algorithms.STNURTE.StrategyEnum
-
Returns the minimum possible execution time,
l
, with all nodes that can be executed at that time, i.e.,l' ≤ l
.
It is assumed thatcandidates.timeInterval = [l, u]
and each node has a time interval[l',u']
such thatl ≤ l'
andu ≤ u'
. - Edge - Interface in it.univr.di.cstnu.graph
-
Root class for representing edges in the 'it.univr.di.cstnu package'.
- EDGE_CASE_VALUE_KEY - Static variable in class it.univr.di.cstnu.graph.TNGraphMLWriter
- EDGE_LABELED_LC_VALUE_KEY - Static variable in class it.univr.di.cstnu.graph.TNGraphMLWriter
- EDGE_LABELED_UC_VALUE_KEY - Static variable in class it.univr.di.cstnu.graph.TNGraphMLWriter
- EDGE_LABELED_VALUE_KEY - Static variable in class it.univr.di.cstnu.graph.TNGraphMLWriter
- EDGE_NAME_PREFIX - Static variable in class it.univr.di.cstnu.util.OSTNURandomGenerator
-
Default edge name prefix
- EDGE_NAME_PREFIX - Static variable in class it.univr.di.cstnu.util.STNURandomGenerator
-
Default edge name prefix
- EDGE_PROBABILITY - Static variable in class it.univr.di.cstnu.util.OSTNURandomGenerator
-
Default edge probability for each pair of nodes
- EDGE_PROBABILITY - Static variable in class it.univr.di.cstnu.util.STNURandomGenerator
-
Default-edge probability for each pair of nodes
- EDGE_TYPE_KEY - Static variable in class it.univr.di.cstnu.graph.TNGraphMLWriter
- EDGE_VALUE_KEY - Static variable in class it.univr.di.cstnu.graph.TNGraphMLWriter
- Edge.ConstraintType - Enum Class in it.univr.di.cstnu.graph
-
Possible types of an edge.
- EdgeData(LabeledNode, LabeledNode, int) - Constructor for class it.univr.di.cstnu.algorithms.STNU.EdgeData
-
Constructor for an immutable edgeData object.
- edgeDrawPaintFunction(PickedInfo<K>, Paint, Paint, Paint, Paint, Paint) - Static method in enum class it.univr.di.cstnu.visualization.EdgeRendering
-
Returns a transformer to select the color that is used to draw the edge.
- edgeFactory - Variable in class it.univr.di.cstnu.visualization.EditingModalGraphMouse
- edgeFactory - Variable in class it.univr.di.cstnu.visualization.EditingPopupGraphMousePlugin
- edgeFillPaintFunction(Paint, Paint, Paint) - Static method in enum class it.univr.di.cstnu.visualization.EdgeRendering
-
An edge is usually drawn as an arc between two points.
- edgeFontFunction - Static variable in enum class it.univr.di.cstnu.visualization.EdgeRendering
-
Font for edge label rendering
- edgeLabelFunction - Static variable in enum class it.univr.di.cstnu.visualization.EdgeRendering
-
Font for edge label rendering
- edgePathAnnotation - Variable in class it.univr.di.cstnu.algorithms.STNU.STNUCheckStatus
-
It maintains, for each edge (key), the STNUPath that determined the edge.
- EdgeRendering - Enum Class in it.univr.di.cstnu.visualization
-
Edge rendering.
- edgesToCheck - Variable in class it.univr.di.cstnu.algorithms.AbstractCSTN.EdgesToCheck
-
It must be a set because an edge could be added more than once!
- edgesToCheck - Variable in class it.univr.di.cstnu.visualization.TNEditor
-
Edges to check in CSTN(U) check step-by-step
- EdgesToCheck() - Constructor for class it.univr.di.cstnu.algorithms.AbstractCSTN.EdgesToCheck
- EdgesToCheck(Collection<? extends E>) - Constructor for class it.univr.di.cstnu.algorithms.AbstractCSTN.EdgesToCheck
-
A simple constructor when the initial set of edges is available.
- edgeStrokeFunction - Static variable in enum class it.univr.di.cstnu.visualization.EdgeRendering
-
Select how to draw an edge given its type.
- EdgeSupplier<E> - Class in it.univr.di.cstnu.graph
-
This supplier requires as E a class that implements
Edge
interface and that contains the following three constructors: E(Class<? - EdgeSupplier(Class<? extends E>) - Constructor for class it.univr.di.cstnu.graph.EdgeSupplier
- edgeSupport - Variable in class it.univr.di.cstnu.visualization.EditingGraphMousePlugin
-
Helper for creating an edge
- edgeType() - Method in record class it.univr.di.cstnu.algorithms.STNU.STNUCheckStatus.SRNCInfo
-
Returns the value of the
edgeType
record component. - EditingGraphMousePlugin<V,
E> - Class in it.univr.di.cstnu.visualization -
A plugin that can create vertices, undirected edges, and directed edges using mouse gestures. vertexSupport and edgeSupport member classes are responsible for actually creating the new graph elements and for repainting the view when changes are made.
- EditingGraphMousePlugin(Supplier<V>, Supplier<E>) - Constructor for class it.univr.di.cstnu.visualization.EditingGraphMousePlugin
-
Creates an instance and prepares shapes for visual effects, using the default modifiers of the designed button (button 1).
- EditingModalGraphMouse<V,
E> - Class in it.univr.di.cstnu.visualization -
I modified the source to use a local EditingGraphMousePlugin and remove some extra useless features.
- EditingModalGraphMouse(RenderContext<V, E>, Supplier<V>, Supplier<E>, TNEditor, boolean) - Constructor for class it.univr.di.cstnu.visualization.EditingModalGraphMouse
-
Creates an instance with default values.
- EditingModalGraphMouse.ModeKeyAdapter - Class in it.univr.di.cstnu.visualization
-
Personalization of the key adapter.
- editingPlugin - Variable in class it.univr.di.cstnu.visualization.EditingModalGraphMouse
- EditingPopupGraphMousePlugin<V,
E> - Class in it.univr.di.cstnu.visualization -
2017-10-23 I added a menu item to manage the export of a graph.
- EditingPopupGraphMousePlugin(Supplier<V>, Supplier<E>) - Constructor for class it.univr.di.cstnu.visualization.EditingPopupGraphMousePlugin
- EDITOR_NAME - Static variable in class it.univr.di.cstnu.visualization.TNEditor
-
Name of the editor panel
- EMPTY_LABEL - Static variable in class it.univr.di.labeledvalue.Constants
-
Char representing empty label: ⊡.
- EMPTY_LABELstring - Static variable in class it.univr.di.labeledvalue.Constants
- EMPTY_UPPER_CASE_LABEL - Static variable in class it.univr.di.labeledvalue.Constants
-
Char representing empty upper case label: ◇.
- EMPTY_UPPER_CASE_LABELstring - Static variable in class it.univr.di.labeledvalue.Constants
- emptyLabel - Static variable in class it.univr.di.labeledvalue.ALabel
-
A constant empty label to represent an empty label that cannot be modified.
- emptyLabel - Static variable in class it.univr.di.labeledvalue.Label
-
A constant empty label to represent an empty label that cannot be modified.
- EmptyLabel() - Constructor for class it.univr.di.labeledvalue.ALabel.EmptyLabel
-
default constructor
- emptyLabeledLowerCaseValue - Static variable in class it.univr.di.labeledvalue.LabeledLowerCaseValue
-
A constant empty label to represent an empty label that cannot be modified.
- end - Variable in class it.univr.di.cstnu.util.ObjectArrayFIFOSetQueue
-
The end position in
ObjectArrayFIFOSetQueue.backingArray
. - enqueue(LabeledNode) - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN.NodesToCheck
- enqueue(K) - Method in class it.univr.di.cstnu.util.ObjectArrayFIFOSetQueue
- enqueueFirst(K) - Method in class it.univr.di.cstnu.util.ObjectArrayFIFOSetQueue
-
Enqueues a new element as the first element (in dequeue order) of the queue.
- entryAsString(Object2IntMap.Entry<Label>) - Static method in class it.univr.di.labeledvalue.AbstractLabeledIntMap
- entryAsString(ALabel, int, Label, boolean) - Static method in class it.univr.di.labeledvalue.LabeledLowerCaseValue
- entryAsString(Label, int) - Static method in class it.univr.di.labeledvalue.AbstractLabeledIntMap
- entryAsString(Label, int, ALabel) - Static method in class it.univr.di.labeledvalue.LabeledALabelIntTreeMap
-
Utility.
- entryComparator - Static variable in interface it.univr.di.labeledvalue.LabeledIntMap
-
A natural comparator for Entry<Label>.
- entrySet() - Method in class it.univr.di.labeledvalue.LabeledALabelIntTreeMap
-
Important The returned set is a view of the map.
- entrySet() - Method in class it.univr.di.labeledvalue.LabeledIntHierarchyMap
- entrySet() - Method in interface it.univr.di.labeledvalue.LabeledIntMap
-
The set of all map entries.
- entrySet() - Method in class it.univr.di.labeledvalue.LabeledIntSimpleMap
-
Deprecated.
- entrySet() - Method in class it.univr.di.labeledvalue.LabeledIntTreeMap
-
The set of all map entries.
- entrySet(ALabel) - Method in class it.univr.di.labeledvalue.LabeledALabelIntTreeMap
-
The returned set is a view of the map.
- environmentStrategy - Variable in class it.univr.di.cstnu.algorithms.STNURTE.RTEState
-
Strategy used by the Environment to choose a duration.
- epsilon - Variable in class it.univr.di.cstnu.algorithms.CSTNEpsilon
-
Reaction time for CSTN
- epsilonPanel - Variable in class it.univr.di.cstnu.visualization.TNEditor
-
The epsilon panel
- equals(ALabelAlphabet.ALetter) - Method in class it.univr.di.labeledvalue.ALabel
-
Compare the letter with an ALetter name.
- equals(Object) - Method in class it.univr.di.cstnu.algorithms.CSTNPSU.PrototypalLink
- equals(Object) - Method in record class it.univr.di.cstnu.algorithms.STNU.ActivationDistanceInfo
-
Indicates whether some other object is "equal to" this one.
- equals(Object) - Method in record class it.univr.di.cstnu.algorithms.STNU.DistancePair
-
Indicates whether some other object is "equal to" this one.
- equals(Object) - Method in record class it.univr.di.cstnu.algorithms.STNU.STNUCheckStatus.SRNCInfo
-
Indicates whether some other object is "equal to" this one.
- equals(Object) - Method in record class it.univr.di.cstnu.algorithms.STNURTE.ContingentLink
-
Indicates whether some other object is "equal to" this one.
- equals(Object) - Method in record class it.univr.di.cstnu.algorithms.STNURTE.NodeEnabledInTimeInterval
-
Indicates whether some other object is "equal to" this one.
- equals(Object) - Method in record class it.univr.di.cstnu.algorithms.STNURTE.NodeOccurrence
-
Indicates whether some other object is "equal to" this one.
- equals(Object) - Method in record class it.univr.di.cstnu.algorithms.STNURTE.NodeWithTimeInterval
-
Indicates whether some other object is "equal to" this one.
- equals(Object) - Method in class it.univr.di.cstnu.graph.AbstractComponent
-
Deprecated.
- equals(Object) - Method in class it.univr.di.cstnu.graph.BasicCSTNUEdgePluggable.InternalEntry
- equals(Object) - Method in interface it.univr.di.cstnu.graph.Component
-
Deprecated.
- equals(Object) - Method in class it.univr.di.cstnu.graph.STNUEdge.CaseLabel
- equals(Object) - Method in class it.univr.di.cstnu.util.Checker.GlobalStatisticKey
- equals(Object) - Method in class it.univr.di.cstnu.util.ObjectPair
- equals(Object) - Method in record class it.univr.di.cstnu.util.OptimizationEngine.OptimizationResult
-
Indicates whether some other object is "equal to" this one.
- equals(Object) - Method in record class it.univr.di.cstnu.util.PSTNRTEBenchmarkRunner.PSTNSituation
-
Indicates whether some other object is "equal to" this one.
- equals(Object) - Method in class it.univr.di.labeledvalue.AbstractLabeledIntMap
- equals(Object) - Method in class it.univr.di.labeledvalue.ALabel.EmptyLabel
- equals(Object) - Method in class it.univr.di.labeledvalue.ALabel
- equals(Object) - Method in class it.univr.di.labeledvalue.ALabelAlphabet.ALetter
- equals(Object) - Method in class it.univr.di.labeledvalue.Label
- equals(Object) - Method in class it.univr.di.labeledvalue.LabeledALabelIntTreeMap
- equals(Object) - Method in class it.univr.di.labeledvalue.LabeledIntHierarchyMap.HierarchyNode
- equals(Object) - Method in class it.univr.di.labeledvalue.LabeledLowerCaseValue
- equals(Object) - Method in class it.univr.di.labeledvalue.Literal
- equals(String) - Method in class it.univr.di.labeledvalue.ALabelAlphabet.ALetter
- equalsByName(Component) - Method in class it.univr.di.cstnu.graph.AbstractComponent
- equalsByName(Component) - Method in interface it.univr.di.cstnu.graph.Component
-
A component is assumed to be equal to another if it has the same name.
- executionTimeHCEns - Variable in class it.univr.di.cstnu.algorithms.STNURTE.RTEState
-
Execution time statistics.
- executionTimeHOEns - Variable in class it.univr.di.cstnu.algorithms.STNURTE.RTEState
-
Execution time statistics.
- executionTimeNS - Variable in class it.univr.di.cstnu.algorithms.STN.STNCheckStatus
-
Execution time in nanoseconds.
- executionTimeObserveNs - Variable in class it.univr.di.cstnu.algorithms.STNURTE.RTEState
-
Execution time statistics.
- executionTimeRTEDecisionNs - Variable in class it.univr.di.cstnu.algorithms.STNURTE.RTEState
-
Execution time statistics.
- executionTimeRTEinitNs - Variable in class it.univr.di.cstnu.algorithms.STNURTE.RTEState
-
Execution time statistics.
- executionTimeRTEns - Variable in class it.univr.di.cstnu.algorithms.STNURTE.RTEState
-
Execution time statistics.
- executionTimeRTEUpdateNs - Variable in class it.univr.di.cstnu.algorithms.STNURTE.RTEState
-
Execution time statistics.
- exitFlag - Variable in class it.univr.di.cstnu.algorithms.PSTN.PSTNCheckStatus
-
xit flag of the minimization procedure.
- exitFlag() - Method in record class it.univr.di.cstnu.util.OptimizationEngine.OptimizationResult
-
Returns the value of the
exitFlag
record component. - ExtendedPriorityQueue<T> - Class in it.univr.di.cstnu.util
-
Simple implementation priority queue where elements are T objects and priorities are integers.
- ExtendedPriorityQueue() - Constructor for class it.univr.di.cstnu.util.ExtendedPriorityQueue
-
Default constructor for minimum priority queue based on binary heap.
- ExtendedPriorityQueue(boolean) - Constructor for class it.univr.di.cstnu.util.ExtendedPriorityQueue
-
Default constructor for min/max priority queue based on binary heap.
- ExtendedPriorityQueue(int) - Constructor for class it.univr.di.cstnu.util.ExtendedPriorityQueue
-
Default constructor for minimum priority queue based on binary heap.
- ExtendedPriorityQueue(int, boolean) - Constructor for class it.univr.di.cstnu.util.ExtendedPriorityQueue
-
General constructor for min/max priority queue based on binary heap.
- ExtendedPriorityQueue.Status - Enum Class in it.univr.di.cstnu.util
-
The possible state of an element with respect to a
ExtendedPriorityQueue
. - extraButtons - Variable in class it.univr.di.cstnu.visualization.TNEditor
-
Some buttons have meaning only in some contexts.
- extractFirst() - Method in class it.univr.di.cstnu.util.ExtendedPriorityQueue
-
Removes and returns the item with minimum (maximum) priority in this heap.
- extractFirstEntry() - Method in class it.univr.di.cstnu.util.ExtendedPriorityQueue
-
Removes and returns the first entry in this heap.
F
- fastDispatchSTNULowerCaseForwardPropagation(STNUEdge, Object2IntMap<LabeledNode>) - Method in class it.univr.di.cstnu.algorithms.STNU
-
Determines the moat edges for the lower-case edge associated with lower-case edge
(actNode, contNode:lowerCaseValue, contNode)
, using the Dijkstra technique based onnodePotential
. - father - Variable in class it.univr.di.labeledvalue.LabeledIntHierarchyMap.HierarchyNode
-
Labeled values subsumed by this.
- FD_STNU - Enum constant in enum class it.univr.di.cstnu.algorithms.STNU.CheckAlgorithm
-
RUL2021 + dispatchable phase
- FD_STNU_IMPROVED - Enum constant in enum class it.univr.di.cstnu.algorithms.STNU.CheckAlgorithm
-
Original FD_STNU improved by removing waits with values greater than the maximum duration of the relative contingent link.
- fdMinSuffix - Static variable in class it.univr.di.cstnu.util.STNURTEBenchmarkRunner
-
Filename suffix of STNU checked by FD_STNU and minimized by the FD_ESTNU algorithm.
- fdSuffix - Static variable in class it.univr.di.cstnu.util.STNURTEBenchmarkRunner
-
Filename suffix of STNU checked by the FD_STNU algorithm.
- FILE_NAME_SUFFIX - Static variable in class it.univr.di.cstnu.algorithms.AbstractCSTN
-
Suffix for file name
- FILE_NAME_SUFFIX - Static variable in class it.univr.di.cstnu.algorithms.PSTN
-
Suffix for file name
- FILE_NAME_SUFFIX - Static variable in class it.univr.di.cstnu.algorithms.STN
-
Suffix for file name
- FILE_NAME_SUFFIX - Static variable in class it.univr.di.cstnu.algorithms.STNU
-
Suffix for file name
- findEdge(LabeledNode, LabeledNode) - Method in class it.univr.di.cstnu.graph.TNGraph
- findEdge(String, String) - Method in class it.univr.di.cstnu.graph.TNGraph
-
Find the edge given the names of the source node and the destination node.
- finished - Enum constant in enum class it.univr.di.cstnu.algorithms.STNU.ElementStatus
- finished - Variable in class it.univr.di.cstnu.algorithms.STN.STNCheckStatus
-
Becomes true if no rule can be applied anymore.
- fInput - Variable in class it.univr.di.cstnu.algorithms.AbstractCSTN
-
The input file containing the CSTN graph in GraphML format.
- fInput - Variable in class it.univr.di.cstnu.algorithms.STN
-
The input file containing the STN graph in GraphML format.
- first() - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN.NodesToCheck
- first() - Method in class it.univr.di.cstnu.util.ObjectArrayFIFOSetQueue
- FIRST_NODE_EARLY_EXECUTION_STRATEGY - Enum constant in enum class it.univr.di.cstnu.algorithms.STNURTE.StrategyEnum
-
Returns the first node between the candidate and the lower bound of its time window that is compatible with the given time window.
- FIRST_NODE_LATE_EXECUTION_STRATEGY - Enum constant in enum class it.univr.di.cstnu.algorithms.STNURTE.StrategyEnum
-
Returns the first node between the candidate and the upper time of its time window, compatible with the given time window.
- FIRST_NODE_MIDDLE_EXECUTION_STRATEGY - Enum constant in enum class it.univr.di.cstnu.algorithms.STNURTE.StrategyEnum
-
Returns the first node between the candidate and the middle time of its time window, compatible with the given time window.
- firstProposition - Variable in class it.univr.di.cstnu.algorithms.OSTNU.OSTNUCheckStatus
-
First free proposition
- formatInt(int) - Static method in class it.univr.di.labeledvalue.Constants
- fOutput - Variable in class it.univr.di.cstnu.algorithms.AbstractCSTN
-
Output file where to write the XML representing the CSTN graph after a check.
- fOutput - Variable in class it.univr.di.cstnu.algorithms.STN
-
Output file where to write the XML representing the minimal STN graph.
- FTNU - Class in it.univr.di.cstnu.algorithms
-
The FTNU model was introduced as an evolution of the CSTNPSU one, having a simpler name and a DC checking algorithm able to determine the guarded bounds correctly.
- FTNU() - Constructor for class it.univr.di.cstnu.algorithms.FTNU
-
Default constructor, package use only!
- FTNU(TNGraph<CSTNPSUEdge>) - Constructor for class it.univr.di.cstnu.algorithms.FTNU
- FTNU(TNGraph<CSTNPSUEdge>, int) - Constructor for class it.univr.di.cstnu.algorithms.FTNU
- FTNU(String) - Constructor for class it.univr.di.cstnu.algorithms.FTNU
-
Helper constructor for FTNU.
G
- g - Variable in class it.univr.di.cstnu.algorithms.AbstractCSTN
-
Input TNGraph.
- g - Variable in class it.univr.di.cstnu.algorithms.STN
-
Input TNGraph.
- gCheckedCleaned - Variable in class it.univr.di.cstnu.algorithms.AbstractCSTN
-
The graph obtained by a check and the cleaning action.
- gCheckedCleaned - Variable in class it.univr.di.cstnu.algorithms.STN
-
TNGraph on which to operate.
- get() - Method in class it.univr.di.cstnu.algorithms.STNU.STNUPath
- get() - Method in interface it.univr.di.cstnu.algorithms.STNURTE.Strategy
- get() - Method in enum class it.univr.di.cstnu.algorithms.STNURTE.StrategyEnum
- get() - Method in class it.univr.di.cstnu.graph.EdgeSupplier
- get() - Method in class it.univr.di.cstnu.graph.LabeledNodeSupplier
- get() - Method in class it.univr.di.labeledvalue.LabeledIntMapSupplier
- get(boolean) - Method in class it.univr.di.labeledvalue.LabeledIntMapSupplier
- get(byte) - Method in class it.univr.di.labeledvalue.ALabelAlphabet
- get(Edge) - Method in class it.univr.di.cstnu.graph.EdgeSupplier
- get(LabeledNode) - Static method in class it.univr.di.cstnu.graph.LabeledNodeSupplier
- get(Label) - Method in class it.univr.di.labeledvalue.LabeledIntHierarchyMap
- get(Label) - Method in interface it.univr.di.labeledvalue.LabeledIntMap
- get(Label) - Method in class it.univr.di.labeledvalue.LabeledIntSimpleMap
-
Deprecated.
- get(Label) - Method in class it.univr.di.labeledvalue.LabeledIntTreeMap
- get(LabeledIntMap) - Method in class it.univr.di.labeledvalue.LabeledIntMapSupplier
- get(LabeledIntMap, boolean) - Method in class it.univr.di.labeledvalue.LabeledIntMapSupplier
- get(Class<K>, int) - Static method in class it.univr.di.cstnu.graph.EdgeSupplier
- get(String) - Method in class it.univr.di.cstnu.graph.EdgeSupplier
- get(String) - Static method in class it.univr.di.cstnu.graph.LabeledNodeSupplier
- get(String, char) - Static method in class it.univr.di.cstnu.graph.LabeledNodeSupplier
- GET_APSP_JohnsonO(TNGraph<STNUEdge>, Object2IntMap<LabeledNode>, STN.STNCheckStatus) - Static method in class it.univr.di.cstnu.algorithms.STNU
-
Determines the minimal distance between all pairs of nodes (all-pair-shortest-paths (APSP)) using the Johnson algorithm.
- GET_APSP_JohnsonOU(TNGraph<STNUEdge>, Object2IntMap<LabeledNode>, STN.STNCheckStatus) - Static method in class it.univr.di.cstnu.algorithms.STNU
-
Determines the minimal distance between all pairs of nodes (all-pair-shortest-paths (APSP)) using the Johnson algorithm.
- GET_BellmanFord_Potential(TNGraph<E>, STNEdge.EdgeValue<E>, STN.STNCheckStatus) - Static method in interface it.univr.di.cstnu.util.GraphAlgs
-
Determines the potential of nodes considering a virtual source node using the Bellman-Ford algorithm.
- GET_BellmanFord_Potential(GraphDistances, LabeledNode) - Static method in interface it.univr.di.cstnu.util.GraphAlgs
-
Determines the potential of nodes considering a virtual source node using the Bellman-Ford algorithm.
- GET_BellmanFord_PotentialO(TNGraph<STNUEdge>, STNU.STNUCheckStatus) - Static method in class it.univr.di.cstnu.algorithms.STNU
-
Helper methods for
GraphAlgs.GET_BellmanFord_Potential(TNGraph, STNEdge.EdgeValue, STNCheckStatus)
where theSTNEdge#EdgeValue
parameter is set to consider the ordinary value. - GET_BellmanFord_PotentialOL(TNGraph<STNUEdge>, STNU.STNUCheckStatus) - Static method in class it.univr.di.cstnu.algorithms.STNU
-
Helper methods for
GraphAlgs.GET_BellmanFord_Potential(TNGraph, STNEdge.EdgeValue, STNCheckStatus)
where theSTNEdge.EdgeValue
parameter is set to consider the minimal value between the ordinary and the lower-case one for each edge. - GET_BellmanFord_PotentialOW(TNGraph<STNUEdge>, STNU.STNUCheckStatus) - Static method in class it.univr.di.cstnu.algorithms.STNU
-
Helper methods for
GraphAlgs.GET_BellmanFord_Potential(TNGraph, STNEdge.EdgeValue, STNCheckStatus)
where theSTNEdge.EdgeValue
parameter is set to consider the minimal value between the ordinary and wait value (if present) for each edge. - GET_DEPTH_FIRST_ORDER(TNPredecessorGraph<E>, LabeledNode, Object2BooleanMap<LabeledNode>, boolean) - Static method in class it.univr.di.cstnu.algorithms.STN
-
Iterative method for determining a depth-first order of nodes.
- GET_MIN_VALUE_BETWEEN_ORDINARY_AND_LOWERCASE(STNUEdge) - Static method in interface it.univr.di.cstnu.graph.STNUEdge
- GET_MIN_VALUE_BETWEEN_ORDINARY_AND_UPPERCASE(STNUEdge) - Static method in interface it.univr.di.cstnu.graph.STNUEdge
- GET_MIN_VALUE_BETWEEN_ORDINARY_AND_WAIT(STNUEdge) - Static method in interface it.univr.di.cstnu.graph.STNUEdge
- GET_REPRESENTATIVE_RIGID_COMPONENTS(ObjectList<ObjectList<LabeledNode>>, Object2IntMap<LabeledNode>, LabeledNode) - Static method in class it.univr.di.cstnu.algorithms.STN
-
For each rigid component with at least two elements, this method determines: 1) the node that should precede the others as representative, and 2) the distances from the representative and the other nodes of the rigid component.
- GET_REPRESENTATIVE_RIGID_COMPONENTS(ObjectList<ObjectList<LabeledNode>>, Object2IntMap<LabeledNode>, LabeledNode, ObjectCollection<LabeledNode>) - Static method in class it.univr.di.cstnu.algorithms.STNU
-
For each rigid component with at least two elements, it determines: The 'representative' node, which should precede the other nodes, and The distances from the representative and the other nodes of the rigid component.
- GET_REVERSE_POST_ORDER_VISIT(TNPredecessorGraph<E>, LabeledNode, Object2BooleanMap<LabeledNode>) - Static method in class it.univr.di.cstnu.algorithms.STN
-
Determine the reverse-post-order of reachable nodes from the given root node in
graph
. - GET_SPFromActivations_JohnsonO(TNGraph<STNUEdge>, Object2IntMap<LabeledNode>) - Method in class it.univr.di.cstnu.algorithms.STNU
-
Determines the minimal distance between each activation node and any other node, considering the Johnson algorithm.
- GET_SSSP_BellmanFord(TNGraph<E>, LabeledNode, boolean, int, boolean, STN.STNCheckStatus) - Static method in interface it.univr.di.cstnu.util.GraphAlgs
-
Determines the minimal distance between the source node and any node (or any node and the sink (==source) if backward) using the Bellman-Ford algorithm.
- GET_SSSP_BellmanFord(TNGraph<E>, LabeledNode, STN.STNCheckStatus) - Static method in interface it.univr.di.cstnu.util.GraphAlgs
-
Determines the minimal distance from the given source node to each other node (single-source-shortest-paths (SSSP)) using the Bellman-Ford algorithm.
- GET_SSSP_Dijkstra(TNGraph<E>, LabeledNode, STN.STNCheckStatus) - Static method in interface it.univr.di.cstnu.util.GraphAlgs
-
Determines the minimal distance between a source node and any node reachable by the source (single-source-shortest-paths (SSSP)) using the Dijkstra algorithm.
- GET_SSSP_Dijkstra(GraphDistances, LabeledNode, ExtendedPriorityQueue<LabeledNode>) - Static method in interface it.univr.di.cstnu.util.GraphAlgs
-
Determines the minimal distance between a source node and any node reachable by the source (single-source-shortest-paths (SSSP)) using the Dijkstra algorithm.
- GET_STN_PRECEDESSOR_SUBGRAPH_OPTIMIZED(TNGraph<E>, LabeledNode, Object2IntMap<LabeledNode>, Object2IntMap<LabeledNode>, TNPredecessorGraph<E>) - Static method in class it.univr.di.cstnu.algorithms.STN
-
Returns the predecessor graph of the given
source
in the given STNgraph
. - GET_STN_PREDECESSOR_SUBGRAPH(TNGraph<E>, LabeledNode, Object2IntMap<LabeledNode>, Object2IntMap<LabeledNode>, TNGraph<E>) - Static method in class it.univr.di.cstnu.algorithms.STN
-
Returns the predecessor graph of the given
source
in the given STNgraph
. - GET_STRONG_CONNECTED_COMPONENTS(TNGraph<E>, LabeledNode) - Static method in class it.univr.di.cstnu.algorithms.STN
-
Determines all the strongly connected components (SCC) having size > 1 and containing the source node, using the Tarjan algorithm.
- GET_UNDOMINATED_EDGES(LabeledNode, TNPredecessorGraph<E>, Object2IntMap<LabeledNode>, EdgeSupplier<E>) - Static method in class it.univr.di.cstnu.algorithms.STN
-
Returns all undominated edges emanating from a given
source
in the predecessor graph without determining and storing the All-Pairs-Shortest-Paths. - getActivationNode(LabeledNode) - Method in class it.univr.di.cstnu.algorithms.CSTNPSU
- getActivationNode(LabeledNode) - Method in class it.univr.di.cstnu.algorithms.CSTNU
- getActivationNodeMap() - Method in class it.univr.di.cstnu.algorithms.PSTN
- getActivationNodeMap() - Method in class it.univr.di.cstnu.algorithms.STNU
- getAfter() - Method in class it.univr.di.cstnu.graph.LabeledNode
- getALabel() - Method in class it.univr.di.cstnu.graph.LabeledNode
- getALabelAlphabet() - Method in class it.univr.di.cstnu.graph.TNGraph
- getALetter() - Method in class it.univr.di.cstnu.graph.LabeledNode
- getALetter() - Method in class it.univr.di.labeledvalue.ALabel
- getAllDeterminedPriorities() - Method in class it.univr.di.cstnu.util.ExtendedPriorityQueue
- getAllLowerCaseAndLabeledValues() - Method in interface it.univr.di.cstnu.graph.CSTNPSUEdge
-
Don't use this set for scanning that requires modifying the internal map; otherwise, this set will become invalid after the first modification.
- getAllLowerCaseAndLabeledValues() - Method in class it.univr.di.cstnu.graph.CSTNPSUEdgePluggable
- getAllUnknown() - Method in class it.univr.di.labeledvalue.Label
- getAllUpperCaseAndLabeledValues() - Method in interface it.univr.di.cstnu.graph.BasicCSTNUEdge
-
Don't use this set for scanning that requires modifying the internal map; otherwise, this set will become invalid after the first modification.
- getAllUpperCaseAndLabeledValues() - Method in class it.univr.di.cstnu.graph.BasicCSTNUEdgePluggable
- getAlphabet() - Method in class it.univr.di.labeledvalue.ALabel
- getApproximatingSTNU() - Method in class it.univr.di.cstnu.algorithms.PSTN.PSTNCheckStatus
- getAvgContingentRangeWidth() - Method in class it.univr.di.cstnu.algorithms.PSTN
- getBefore() - Method in class it.univr.di.cstnu.graph.LabeledNode
- getCaseLabel() - Method in interface it.univr.di.cstnu.graph.STNUEdge
- getCaseLabel() - Method in class it.univr.di.cstnu.graph.STNUEdgeInt
- getCaseStatus() - Method in class it.univr.di.cstnu.graph.STNUEdge.CaseLabel
- getCheckAlgorithm() - Method in class it.univr.di.cstnu.algorithms.STNU.STNUCheckStatus
- getCheckStatus() - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN
-
Getter for the field
checkStatus
, the status of a checking algorithm. - getCheckStatus() - Method in class it.univr.di.cstnu.algorithms.CSTNPSU
- getCheckStatus() - Method in class it.univr.di.cstnu.algorithms.CSTNU
- getCheckStatus() - Method in class it.univr.di.cstnu.algorithms.OSTNU
-
Getter for the field
checkStatus
, the status of a checking algorithm. - getCheckStatus() - Method in class it.univr.di.cstnu.algorithms.STN
-
Getter for the field
checkStatus
. - getCheckStatus() - Method in class it.univr.di.cstnu.algorithms.STNU
- getChildrenOf(LabeledNode) - Method in class it.univr.di.cstnu.graph.TNGraph
-
Given an observation node
obs
that observes the proposition 'p', its 'children' are all observation nodes, Q, for which 'p' appears in the label of node Q. - getCleanedOutput() - Method in class it.univr.di.cstnu.algorithms.STNU
- getClockName(LabeledNode) - Static method in class it.univr.di.cstnu.util.CSTNU2UppaalTiga
-
Build a clock name: "t" followed by node name, cleaned off not allowed chars.
- getComplement() - Method in class it.univr.di.labeledvalue.Literal
-
Returns the complement of this.
- getConstraintType() - Method in class it.univr.di.cstnu.graph.AbstractEdge
- getConstraintType() - Method in interface it.univr.di.cstnu.graph.Edge
- getContingency() - Method in class it.univr.di.cstnu.algorithms.CSTNPSU.PrototypalLink
- getContingencyGraph() - Method in class it.univr.di.cstnu.algorithms.CSTNPSU
-
The contingency graph is a labeled graph for determining the contingency value of each node.
- getContingent() - Method in class it.univr.di.cstnu.util.Checker.GlobalStatisticKey
- getContingentNodeCount() - Method in class it.univr.di.cstnu.graph.TNGraph
- getCstnEditor() - Method in class it.univr.di.cstnu.visualization.CSTNUGraphAttributeEditingMousePlugin
- getCurrentTimeWindow(LabeledNode) - Method in class it.univr.di.cstnu.algorithms.STNURTE.RTEState
- getDcInstanceNumber() - Method in class it.univr.di.cstnu.util.OSTNURandomGenerator
-
getDcInstanceNumber.
- getDcInstanceNumber() - Method in class it.univr.di.cstnu.util.STNURandomGenerator
- getDcInstances() - Method in class it.univr.di.cstnu.util.CSTNRandomGenerator
-
Getter for the field
dcInstances
. - getDefaultConsistencyCheckAlg() - Method in class it.univr.di.cstnu.algorithms.STN
-
Getter for the field
defaultConsistencyCheckAlg
. - getDefaultControllabilityCheckAlg() - Method in class it.univr.di.cstnu.algorithms.STNU
- getDest(E) - Method in class it.univr.di.cstnu.graph.TNGraph
- getDest(String) - Method in class it.univr.di.cstnu.graph.TNGraph
-
Wrapper
TNGraph.getDest(Edge)
- getDistance(LabeledNode, LabeledNode) - Method in interface it.univr.di.cstnu.util.GraphDistances
- getDistance(LabeledNode, LabeledNode) - Method in class it.univr.di.cstnu.util.GraphDistancesImpl
- getEdge(String) - Method in class it.univr.di.cstnu.graph.TNGraph
-
Returns the edge associated with the name.
- getEdgeCount() - Method in class it.univr.di.cstnu.graph.TNGraph
- getEdgeEditingPlugin() - Method in class it.univr.di.cstnu.visualization.EditingModalGraphMouse
-
getEdgeEditingPlugin.
- getEdgeFactory() - Method in class it.univr.di.cstnu.graph.TNGraph
-
Getter for the field
edgeFactory
. - getEdgeFromObserversToNode(LabeledNode) - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN
-
Determines the set of edges P?
- getEdgeImplClass() - Method in class it.univr.di.cstnu.graph.EdgeSupplier
- getEdgeImplClass() - Method in class it.univr.di.cstnu.graph.TNGraph
- getEdgePathAnnotation() - Method in class it.univr.di.cstnu.algorithms.STNU.STNUCheckStatus
- getEdgeProb() - Method in class it.univr.di.cstnu.util.CSTNRandomGenerator
-
Getter for the field
edgeProb
. - getEdgeProb() - Method in class it.univr.di.cstnu.util.OSTNURandomGenerator
-
Getter for the field
edgeProb
. - getEdgeProb() - Method in class it.univr.di.cstnu.util.STNURandomGenerator
- getEdges() - Method in class it.univr.di.cstnu.graph.TNGraph
-
Returns an independent collection of the edges of this graph.
- getEdgesAndNodes() - Method in class it.univr.di.cstnu.graph.TNGraph
-
It is an optimization of
TNGraph.getInEdges(LabeledNode)
that also returns the source node of the incoming edge. - getEdgesOrdered() - Method in class it.univr.di.cstnu.graph.TNGraph
- getEdgeSupport() - Method in class it.univr.di.cstnu.visualization.EditingGraphMousePlugin
- getEditingPlugin() - Method in class it.univr.di.cstnu.visualization.EditingModalGraphMouse
- getElements() - Method in class it.univr.di.cstnu.util.ExtendedPriorityQueue
-
It runs in O(n) time.
- getEndingNodeName() - Method in class it.univr.di.cstnu.algorithms.CSTNPSU.PrototypalLink
- getEndpoints(E) - Method in class it.univr.di.cstnu.graph.TNGraph
-
getEdgesArray.
- getEpsilonReactionTime() - Method in class it.univr.di.cstnu.algorithms.CSTNEpsilon
- getExternalNodeOfPropositionPair(char) - Method in class it.univr.di.cstnu.algorithms.OSTNU.OSTNUCheckStatus
- getFileName() - Method in class it.univr.di.cstnu.graph.TNGraph
- getfInput() - Method in class it.univr.di.cstnu.algorithms.PSTN
- getfInput() - Method in class it.univr.di.cstnu.algorithms.STNU
- getFirst() - Method in class it.univr.di.cstnu.util.ObjectPair
- getFirstEntry() - Method in class it.univr.di.cstnu.util.ExtendedPriorityQueue
-
It runs in O(1) time.
- getFirstPriority() - Method in class it.univr.di.cstnu.util.ExtendedPriorityQueue
- getfOutput() - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN
-
Getter for the field
fOutput
. - getfOutput() - Method in class it.univr.di.cstnu.algorithms.PSTN
- getfOutput() - Method in class it.univr.di.cstnu.algorithms.STN
- getfOutput() - Method in class it.univr.di.cstnu.algorithms.STNU
- getG() - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN
-
Getter for the field
g
, the input graph. - getG() - Method in class it.univr.di.cstnu.algorithms.PSTN
- getG() - Method in class it.univr.di.cstnu.algorithms.STN
- getG() - Method in class it.univr.di.cstnu.algorithms.STNU
- getG() - Method in class it.univr.di.cstnu.algorithms.STNURTE
- getGChecked() - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN
-
Getter for the resulting checked graph.
- getGChecked() - Method in class it.univr.di.cstnu.algorithms.STN
- getGChecked() - Method in class it.univr.di.cstnu.algorithms.STNU
- getGCheckedAsGraphML() - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN
-
Helper method for having the graph obtained by
AbstractCSTN.getGChecked()
in GraphML format. - getGraphLabelDescription(TNGraph<?>) - Static method in class it.univr.di.cstnu.visualization.TNEditor
- getHorizon() - Method in class it.univr.di.cstnu.algorithms.PSTN
- getHorizon() - Method in class it.univr.di.cstnu.algorithms.STNU
- getIncidentEdges(LabeledNode) - Method in class it.univr.di.cstnu.graph.TNGraph
- getInEdges(LabeledNode) - Method in class it.univr.di.cstnu.graph.TNGraph
- getInEdgesAndNodes(LabeledNode) - Method in class it.univr.di.cstnu.graph.TNGraph
-
It is an optimization of
TNGraph.getInEdges(LabeledNode)
that also returns the source node of the incoming edge. - getInitialX() - Method in class it.univr.di.cstnu.visualization.CSTNLayout
- getInitialY() - Method in class it.univr.di.cstnu.visualization.CSTNLayout
- getIntValue() - Method in class it.univr.di.labeledvalue.LabeledIntHierarchyMap.HierarchyNode
- getKey() - Method in class it.univr.di.cstnu.graph.BasicCSTNUEdgePluggable.InternalEntry
- getKey() - Method in class it.univr.di.labeledvalue.LabeledIntHierarchyMap.HierarchyNode
- getLabel() - Method in class it.univr.di.cstnu.graph.LabeledNode
- getLabel() - Method in class it.univr.di.labeledvalue.LabeledLowerCaseValue
- getLabel4PairContingentExternalNode(LabeledNode, LabeledNode, boolean) - Method in class it.univr.di.cstnu.algorithms.OSTNU.OSTNUCheckStatus
- getLabel4ValueInvolvingContingent(LabeledNode, LabeledNode, boolean) - Method in class it.univr.di.cstnu.algorithms.OSTNU
- getLabeledIntMapImplClass() - Method in interface it.univr.di.cstnu.graph.CSTNEdge
- getLabeledIntMapImplClass() - Method in class it.univr.di.cstnu.graph.CSTNEdgePluggable
- getLabelEditingPlugin() - Method in class it.univr.di.cstnu.visualization.EditingModalGraphMouse
- getLabeledPotential() - Method in class it.univr.di.cstnu.graph.LabeledNode
-
Returns the map of node-labeled potentials.
- getLabeledPotential(Label) - Method in class it.univr.di.cstnu.graph.LabeledNode
-
Returns the potential associated with label 'l', if it exists;
Constants.INT_NULL
otherwise. - getLabeledPotentialCount(Label) - Method in class it.univr.di.cstnu.graph.LabeledNode
- getLabeledUpperPotential() - Method in class it.univr.di.cstnu.graph.LabeledNode
-
Returns the map of node labeled upper-potentials.
- getLabeledUpperPotential(Label) - Method in class it.univr.di.cstnu.graph.LabeledNode
-
Returns the upper potential associated with label 'l', if it exists;
Constants.INT_NULL
otherwise. - getLabeledValue() - Method in interface it.univr.di.cstnu.graph.STNUEdge
- getLabeledValue() - Method in class it.univr.di.cstnu.graph.STNUEdgeInt
- getLabeledValueFormatted() - Method in interface it.univr.di.cstnu.graph.STNUEdge
-
Representation of the labeled value as a string.
- getLabeledValues() - Method in interface it.univr.di.cstnu.graph.CSTNEdge
- getLabeledValues() - Method in class it.univr.di.cstnu.graph.CSTNEdgePluggable
- getLabelsOfLabeledValues() - Method in interface it.univr.di.cstnu.graph.CSTNEdge
- getLabelsOfLabeledValues() - Method in class it.univr.di.cstnu.graph.CSTNEdgePluggable
- getLabelsOfLowerCaseValues() - Method in interface it.univr.di.cstnu.graph.CSTNPSUEdge
- getLabelsOfLowerCaseValues() - Method in class it.univr.di.cstnu.graph.CSTNPSUEdgePluggable
- getLabelsOfLowerCaseValues(ALabel) - Method in interface it.univr.di.cstnu.graph.CSTNPSUEdge
- getLabelsOfLowerCaseValues(ALabel) - Method in class it.univr.di.cstnu.graph.CSTNPSUEdgePluggable
- getLabelsOfUpperCaseValues() - Method in interface it.univr.di.cstnu.graph.BasicCSTNUEdge
- getLabelsOfUpperCaseValues() - Method in class it.univr.di.cstnu.graph.BasicCSTNUEdgePluggable
- getLabelsOfUpperCaseValues(ALabel) - Method in interface it.univr.di.cstnu.graph.BasicCSTNUEdge
- getLabelsOfUpperCaseValues(ALabel) - Method in class it.univr.di.cstnu.graph.BasicCSTNUEdgePluggable
- getLetter(byte) - Method in class it.univr.di.labeledvalue.ALabel
- getLiterals() - Method in class it.univr.di.labeledvalue.Label
- getLocation() - Method in class it.univr.di.cstnu.util.LogNormalDistributionParameter
- getLocations() - Method in class it.univr.di.cstnu.visualization.CSTNUStaticLayout
- getLogNormalDistribution() - Method in class it.univr.di.cstnu.graph.LabeledNode
- getLogNormalDistribution() - Method in class it.univr.di.cstnu.util.LogNormalDistributionParameter
- getLower() - Method in class it.univr.di.cstnu.util.TimeInterval
- getLowerBound() - Method in class it.univr.di.cstnu.algorithms.CSTNPSU.PrototypalLink
- getLowerCaseEdgesMap() - Method in class it.univr.di.cstnu.algorithms.PSTN
-
Returns a map containing the lower-case edges associated with the contingent link of the network if the network was initialized (
PSTN.initAndCheck()
executed successfully); null otherwise. - getLowerCaseEdgesMap() - Method in class it.univr.di.cstnu.algorithms.STNU
-
Returns a map containing the lower-case edges associated with the contingent link of the network if the network was initialized (
STNU.initAndCheck()
executed successfully); null otherwise. - getLowerCaseLabels() - Method in interface it.univr.di.cstnu.graph.CSTNPSUEdge
- getLowerCaseLabels() - Method in class it.univr.di.cstnu.graph.CSTNPSUEdgePluggable
- getLowerCaseValue() - Method in interface it.univr.di.cstnu.graph.CSTNUEdge
- getLowerCaseValue() - Method in class it.univr.di.cstnu.graph.CSTNUEdgePluggable
- getLowerCaseValue(Label, ALabel) - Method in interface it.univr.di.cstnu.graph.CSTNPSUEdge
- getLowerCaseValue(Label, ALabel) - Method in class it.univr.di.cstnu.graph.CSTNPSUEdgePluggable
- getLowerCaseValues() - Method in interface it.univr.di.cstnu.graph.CSTNPSUEdge
-
Don't use this set for scanning that requires modifying the internal map; otherwise, this set will become invalid after the first modification.
- getLowerCaseValues() - Method in class it.univr.di.cstnu.graph.CSTNPSUEdgePluggable
- getLowerCaseValues(ALabel) - Method in interface it.univr.di.cstnu.graph.CSTNPSUEdge
- getLowerCaseValues(ALabel) - Method in class it.univr.di.cstnu.graph.CSTNPSUEdgePluggable
- getLowerContingentLink(LabeledNode) - Method in class it.univr.di.cstnu.algorithms.CSTNPSU
- getLowerContingentLink(LabeledNode) - Method in class it.univr.di.cstnu.algorithms.CSTNU
- getLowerGuard() - Method in class it.univr.di.cstnu.algorithms.CSTNPSU.PrototypalLink
- getLowerLabeledEdges() - Method in class it.univr.di.cstnu.graph.TNGraph
- getMaximum() - Method in class it.univr.di.cstnu.util.ActiveWaits
- getMaxMinConstraint() - Method in class it.univr.di.cstnu.algorithms.STNU.STNUCheckStatus
- getMaxPathContingencySpanInContingencyGraph(String, TNGraph<CSTNEdge>) - Static method in class it.univr.di.cstnu.algorithms.CSTNPSU
-
Returns the labeled path contingency span of node with name
nodeName
. - getMaxValue() - Method in interface it.univr.di.labeledvalue.LabeledIntMap
- getMaxValue() - Method in class it.univr.di.labeledvalue.LabeledIntTreeMap
- getMaxValueSubsumedBy(Label) - Method in interface it.univr.di.labeledvalue.LabeledIntMap
-
Returns the value associated with the
l
if it exists, otherwise the maximal value among all labels consistent withl
. - getMaxWeight() - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN
-
Getter for the field
maxWeight
. - getMaxWeight() - Method in class it.univr.di.cstnu.algorithms.PSTN
- getMaxWeight() - Method in class it.univr.di.cstnu.algorithms.STNU
- getMaxWeight() - Method in class it.univr.di.cstnu.util.CSTNRandomGenerator
-
Getter for the field
maxWeight
. - getMaxWeight() - Method in class it.univr.di.cstnu.util.OSTNURandomGenerator
-
Getter for the field
maxWeight
. - getMaxWeight() - Method in class it.univr.di.cstnu.util.STNURandomGenerator
- getMinimalDistanceGraph(TNGraph<E>) - Static method in class it.univr.di.cstnu.algorithms.AbstractCSTN
-
Determines the minimal distance between all pairs of vertices, modifying the given consistent graph.
- getMinLabeledValue() - Method in interface it.univr.di.cstnu.graph.CSTNEdge
- getMinLabeledValue() - Method in class it.univr.di.cstnu.graph.CSTNEdgePluggable
- getMinLabeledValue() - Method in interface it.univr.di.labeledvalue.LabeledIntMap
- getMinLowerCaseValue() - Method in interface it.univr.di.cstnu.graph.CSTNPSUEdge
- getMinLowerCaseValue() - Method in class it.univr.di.cstnu.graph.CSTNPSUEdgePluggable
- getMinNegativeWeight() - Method in class it.univr.di.cstnu.algorithms.STN
- getMinUpperCaseValue() - Method in interface it.univr.di.cstnu.graph.BasicCSTNUEdge
- getMinUpperCaseValue() - Method in class it.univr.di.cstnu.graph.BasicCSTNUEdgePluggable
- getMinUpperCaseValue(ALabel) - Method in interface it.univr.di.cstnu.graph.BasicCSTNUEdge
- getMinUpperCaseValue(ALabel) - Method in class it.univr.di.cstnu.graph.BasicCSTNUEdgePluggable
- getMinValue() - Method in interface it.univr.di.cstnu.graph.CSTNEdge
- getMinValue() - Method in class it.univr.di.cstnu.graph.CSTNEdgePluggable
- getMinValue() - Method in class it.univr.di.labeledvalue.LabeledALabelIntTreeMap
- getMinValue() - Method in interface it.univr.di.labeledvalue.LabeledIntMap
- getMinValue() - Method in class it.univr.di.labeledvalue.LabeledIntTreeMap
- getMinValue(ALabel) - Method in class it.univr.di.labeledvalue.LabeledALabelIntTreeMap
-
Returns a copy of the entry containing the min value associated with ALabel
p
. - getMinValueAmongLabelsWOUnknown() - Method in interface it.univr.di.labeledvalue.LabeledIntMap
- getMinValueConsistentWith(Label) - Method in class it.univr.di.labeledvalue.LabeledIntHierarchyMap
- getMinValueConsistentWith(Label) - Method in interface it.univr.di.labeledvalue.LabeledIntMap
-
Returns the value associated with the
l
if it exists, otherwise the minimal value among all labels consistent withl
. - getMinValueConsistentWith(Label, ALabel) - Method in class it.univr.di.labeledvalue.LabeledALabelIntTreeMap
-
Returns the value associated with
(l, p)
if it exists, otherwise the minimal value among all labels consistent with(l, p)
. - getMinValueSubsumedBy(Label) - Method in interface it.univr.di.cstnu.graph.CSTNEdge
- getMinValueSubsumedBy(Label) - Method in class it.univr.di.cstnu.graph.CSTNEdgePluggable
- getMinValueSubsumedBy(Label) - Method in class it.univr.di.labeledvalue.LabeledIntHierarchyMap
- getMinValueSubsumedBy(Label) - Method in interface it.univr.di.labeledvalue.LabeledIntMap
-
Returns the minimal value among those associated with labels subsumed by
l
if it exists,Constants.INT_NULL
otherwise. - getMinValueSubsumedBy(Label) - Method in class it.univr.di.labeledvalue.LabeledIntTreeMap
- getModeComboBox() - Method in class it.univr.di.cstnu.visualization.EditingModalGraphMouse
- getModeMenu() - Method in class it.univr.di.cstnu.visualization.EditingModalGraphMouse
- getName() - Method in class it.univr.di.cstnu.graph.AbstractComponent
- getName() - Method in interface it.univr.di.cstnu.graph.Component
- getName() - Method in class it.univr.di.cstnu.graph.STNUEdge.CaseLabel
- getName() - Method in class it.univr.di.cstnu.graph.TNGraph
- getName() - Method in class it.univr.di.labeledvalue.Literal
- getNegated() - Method in class it.univr.di.labeledvalue.Literal
-
Returns a literal that is the negation of this.
- getNegativeScenarios() - Method in class it.univr.di.cstnu.algorithms.OSTNU.OSTNUCheckStatus
- getNegativeSTNUCycleInfo(boolean, TNGraph<STNUEdge>) - Method in class it.univr.di.cstnu.algorithms.STNU.STNUCheckStatus
- getNeighbors(LabeledNode) - Method in class it.univr.di.cstnu.graph.TNGraph
- getnNodes() - Method in class it.univr.di.cstnu.util.CSTNRandomGenerator
-
Getter for the field
nNodes
. - getnNodesQLoop() - Method in class it.univr.di.cstnu.util.CSTNRandomGenerator
-
Getter for the field
nNodesQLoop
. - getnObsQLoop() - Method in class it.univr.di.cstnu.util.CSTNRandomGenerator
-
Getter for the field
nObsQLoop
. - getNode(String) - Method in class it.univr.di.cstnu.graph.TNGraph
-
Returns the node associated with the name.
- getNode(String) - Method in class it.univr.di.cstnu.graph.TNPredecessorGraph
-
Return the node associated with the name.
- getNodeFactory() - Method in class it.univr.di.cstnu.graph.TNGraph
- getNodeName() - Method in class it.univr.di.labeledvalue.LabeledLowerCaseValue
- getNodeNumber() - Method in class it.univr.di.cstnu.util.OSTNURandomGenerator
-
getNodeNumber.
- getNodeNumber() - Method in class it.univr.di.cstnu.util.STNURandomGenerator
- getNodes() - Method in class it.univr.di.cstnu.util.Checker.GlobalStatisticKey
- getNodes() - Method in interface it.univr.di.cstnu.util.GraphDistances
- getNodes() - Method in class it.univr.di.cstnu.util.GraphDistancesImpl
- getNodesOrdered() - Method in class it.univr.di.cstnu.graph.TNGraph
- getNotDCInstanceNumber() - Method in class it.univr.di.cstnu.util.OSTNURandomGenerator
-
getNotDCInstanceNumber.
- getNotDCInstanceNumber() - Method in class it.univr.di.cstnu.util.STNURandomGenerator
- getNotDCInstances() - Method in class it.univr.di.cstnu.util.CSTNRandomGenerator
-
Getter for the field
notDCInstances
. - getNotDCSubDir() - Method in class it.univr.di.cstnu.util.CSTNRandomGenerator
-
Getter for the field
notDCSubDir
. - getNotDCSubDir() - Method in class it.univr.di.cstnu.util.OSTNURandomGenerator
-
Getter for the field
notDCSubDir
. - getNotDCSubDir() - Method in class it.univr.di.cstnu.util.STNURandomGenerator
- getnPropositions() - Method in class it.univr.di.cstnu.util.CSTNRandomGenerator
-
Getter for the field
nPropositions
. - getnQLoops() - Method in class it.univr.di.cstnu.util.CSTNRandomGenerator
-
Getter for the field
nQLoops
. - getObservedAndObserver() - Method in class it.univr.di.cstnu.graph.TNGraph
- getObserver(char) - Method in class it.univr.di.cstnu.graph.TNGraph
- getObserver2ZEdges() - Method in class it.univr.di.cstnu.graph.TNGraph
-
Be careful!
- getObserverCount() - Method in class it.univr.di.cstnu.graph.TNGraph
- getObservers() - Method in class it.univr.di.cstnu.graph.TNGraph
- getObsQLoopNumber() - Method in class it.univr.di.cstnu.util.OSTNURandomGenerator
-
getObsQLoopNumber.
- getObsQLoopNumber() - Method in class it.univr.di.cstnu.util.STNURandomGenerator
- getOptimizationEngine() - Method in class it.univr.di.cstnu.algorithms.PSTN
- getOrderedSchedule() - Method in class it.univr.di.cstnu.algorithms.STNURTE.RTEState
- getOutEdges(LabeledNode) - Method in class it.univr.di.cstnu.graph.TNGraph
- getOutEdgesAndNodes(LabeledNode) - Method in class it.univr.di.cstnu.graph.TNGraph
-
It is an optimization of
TNGraph.getOutEdges(LabeledNode)
that also returns the destination node of the outgoing edge. - getPopupEditingPlugin() - Method in class it.univr.di.cstnu.visualization.EditingModalGraphMouse
- getPotential() - Method in class it.univr.di.cstnu.graph.LabeledNode
- getPredecessor() - Method in class it.univr.di.cstnu.graph.LabeledNode
- getPredecessors(LabeledNode) - Method in class it.univr.di.cstnu.graph.TNGraph
- getPredecessors(LabeledNode) - Method in class it.univr.di.cstnu.graph.TNPredecessorGraph
-
Returns the list of predecessors (with incoming edge) of the given node.
- getPriority(T) - Method in class it.univr.di.cstnu.util.ExtendedPriorityQueue
-
Returns the priority of the item if it is or was present in the queue,
Constants.INT_POS_INFINITE
if the item was never inserted, and this is a min queue,Constants.INT_NEG_INFINITE
if the item was never inserted and this is a max queue. - getProbabilityMass() - Method in class it.univr.di.cstnu.algorithms.PSTN.PSTNCheckStatus
- getPropositionObserved() - Method in class it.univr.di.cstnu.graph.LabeledNode
- getPropositionOfPair() - Method in class it.univr.di.cstnu.algorithms.OSTNU.OSTNUCheckStatus
- getPropositions() - Method in class it.univr.di.cstnu.graph.TNGraph
-
getPropositions.
- getPropositions() - Method in class it.univr.di.cstnu.util.Checker.GlobalStatisticKey
- getPropositions() - Method in class it.univr.di.labeledvalue.Label
- getPrototypalLink() - Method in class it.univr.di.cstnu.algorithms.CSTNPSU
-
Checks the DC property and, if DC, returns the prototypal link that represents the global temporal behavior of the network.
- getReachable(LabeledNode) - Method in interface it.univr.di.cstnu.util.GraphDistances
- getReachable(LabeledNode) - Method in class it.univr.di.cstnu.util.GraphDistancesImpl
- getReactionTime() - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN
-
Getter for the field
reactionTime
. - getReturnedObjectClass() - Method in class it.univr.di.labeledvalue.LabeledIntMapSupplier
- getRigidComponents() - Method in class it.univr.di.cstnu.algorithms.STN
-
Determines all the Rigid Components (RC) using the linear time algorithm (w.r.t. the |edges|) proposed by Tsamardinos, I., Muscettola, N., & Morris, P. (1998).
- getScale() - Method in class it.univr.di.cstnu.util.LogNormalDistributionParameter
- getSchedule() - Method in class it.univr.di.cstnu.algorithms.STNURTE.RTEState
- getSecond() - Method in class it.univr.di.cstnu.util.ObjectPair
- getShift() - Method in class it.univr.di.cstnu.util.LogNormalDistributionParameter
- getSource(E) - Method in class it.univr.di.cstnu.graph.TNGraph
- getSource(String) - Method in class it.univr.di.cstnu.graph.TNGraph
-
Wrapper of
TNGraph.getSource(Edge)
- getSrn() - Method in class it.univr.di.cstnu.algorithms.PSTN.PSTNCheckStatus
- getSrncKind() - Method in class it.univr.di.cstnu.algorithms.PSTN.PSTNCheckStatus
- getSrncKind() - Method in class it.univr.di.cstnu.algorithms.STNU.STNUCheckStatus
- getStartingNodeName() - Method in class it.univr.di.cstnu.algorithms.CSTNPSU.PrototypalLink
- getState() - Method in class it.univr.di.labeledvalue.Literal
- getState(byte) - Method in class it.univr.di.labeledvalue.ALabel
- getState(char) - Method in class it.univr.di.labeledvalue.Label
- getStateLiteralWithSameName(char) - Method in class it.univr.di.labeledvalue.Label
- getStateOrdinal(char) - Static method in class it.univr.di.labeledvalue.Literal
-
Returns the ordinal associate to
state
. - getStatus() - Method in class it.univr.di.cstnu.graph.LabeledNode
- getStatus(T) - Method in class it.univr.di.cstnu.util.ExtendedPriorityQueue
-
Usually, in a priority queue, an object is first added and, possibly, removed.
- getSTNPredecessorSubgraph(LabeledNode) - Method in class it.univr.di.cstnu.algorithms.STN
-
Returns the Muscettola predecessor graph of the given
source
in the current STN. - getStraight() - Method in class it.univr.di.labeledvalue.Literal
-
Returns a literal that is the straight literal of this.
- getStrongConnectedComponents(LabeledNode) - Method in class it.univr.di.cstnu.algorithms.STN
-
Determines all the strongly connected components (SCC) of size > 1 containing the source node using the Tarjan algorithm.
- getSubLabelIn(Label, boolean) - Method in class it.univr.di.labeledvalue.Label
-
Determines the sub label of
this
that is also present (not present) in labellab
. - getSubLabelIn(Label, boolean, boolean) - Method in class it.univr.di.labeledvalue.Label
-
Determines the sub label of
this
that is also present (not present) in labellab
. - getSuccessors(LabeledNode) - Method in class it.univr.di.cstnu.graph.TNGraph
- getSuccessors(LabeledNode) - Method in class it.univr.di.cstnu.graph.TNPredecessorGraph
-
Returns the list of successors (with outgoing edge) of the given node.
- getTimeOut() - Method in class it.univr.di.cstnu.algorithms.PSTN
- getTimeOut() - Method in class it.univr.di.cstnu.algorithms.STNU
- getType() - Method in exception class it.univr.di.cstnu.algorithms.WellDefinitionException
- getType() - Method in class it.univr.di.cstnu.graph.TNGraph
- getULCaseLabeledPotential() - Method in class it.univr.di.cstnu.graph.LabeledNode
-
Returns the map of node upper/lower-case labeled potentials.
- getULCaseLabeledUpperPotential() - Method in class it.univr.di.cstnu.graph.LabeledNode
-
Returns the map of upper/lower case labeled UPPER potential of the node.
- getUniqueDifferentLiteral(Label) - Method in class it.univr.di.labeledvalue.Label
-
Finds and returns the unique different literal between
this
andlab
if it exists. - getUniqueEdgeName(String) - Method in class it.univr.di.cstnu.graph.TNGraph
- getUnknown() - Method in class it.univr.di.labeledvalue.Literal
-
Returns a literal that is the unknown literal of this.
- getUpper() - Method in class it.univr.di.cstnu.util.TimeInterval
- getUpperBound() - Method in class it.univr.di.cstnu.algorithms.CSTNPSU.PrototypalLink
- getUpperCaseEdgesMap() - Method in class it.univr.di.cstnu.algorithms.PSTN
-
Returns a map containing the upper-case edges associated with the contingent link of the network if the network was initialized (
PSTN.initAndCheck()
executed successfully); null otherwise. - getUpperCaseEdgesMap() - Method in class it.univr.di.cstnu.algorithms.STNU
-
Returns a map containing the upper-case edges associated with the contingent link of the network if the network was initialized (
STNU.initAndCheck()
executed successfully); null otherwise. - getUpperCaseLabels() - Method in interface it.univr.di.cstnu.graph.BasicCSTNUEdge
- getUpperCaseLabels() - Method in class it.univr.di.cstnu.graph.BasicCSTNUEdgePluggable
- getUpperCaseValue(Label, ALabel) - Method in interface it.univr.di.cstnu.graph.BasicCSTNUEdge
- getUpperCaseValue(Label, ALabel) - Method in class it.univr.di.cstnu.graph.BasicCSTNUEdgePluggable
- getUpperCaseValues() - Method in interface it.univr.di.cstnu.graph.BasicCSTNUEdge
-
Don't use this set for scanning that requires modifying the internal map; otherwise, this set will become invalid after the first modification.
- getUpperCaseValues() - Method in class it.univr.di.cstnu.graph.BasicCSTNUEdgePluggable
- getUpperCaseValues(ALabel) - Method in interface it.univr.di.cstnu.graph.BasicCSTNUEdge
-
Don't use this set for scanning that requires modifying the internal map; otherwise, this set will become invalid after the first modification.
- getUpperCaseValues(ALabel) - Method in class it.univr.di.cstnu.graph.BasicCSTNUEdgePluggable
- getUpperGuard() - Method in class it.univr.di.cstnu.algorithms.CSTNPSU.PrototypalLink
- getUpperLabeledEdges() - Method in class it.univr.di.cstnu.graph.TNGraph
- getValue() - Method in class it.univr.di.cstnu.graph.BasicCSTNUEdgePluggable.InternalEntry
- getValue() - Method in class it.univr.di.cstnu.graph.OSTNUEdgePluggable
- getValue() - Method in interface it.univr.di.cstnu.graph.STNEdge
- getValue() - Method in class it.univr.di.cstnu.graph.STNEdgeInt
- getValue() - Method in class it.univr.di.labeledvalue.LabeledLowerCaseValue
- getValue(E) - Method in interface it.univr.di.cstnu.graph.STNEdge.EdgeValue
-
The interesting value of the edge.
- getValue(Label) - Method in interface it.univr.di.cstnu.graph.CSTNEdge
- getValue(Label) - Method in class it.univr.di.cstnu.graph.CSTNEdgePluggable
- getValue(Label, ALabel) - Method in class it.univr.di.labeledvalue.LabeledALabelIntTreeMap
- getVersionAndCopyright() - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN
- getVersionAndCopyright() - Method in class it.univr.di.cstnu.algorithms.PSTN
- getVersionAndCopyright() - Method in class it.univr.di.cstnu.algorithms.STN
- getVersionAndCopyright() - Method in class it.univr.di.cstnu.algorithms.STNU
- getVersionAndCopyright() - Method in class it.univr.di.cstnu.algorithms.STNURTE
- getVersionAndCopyright() - Method in class it.univr.di.cstnu.util.CSTNRandomGenerator
- getVersionAndCopyright() - Method in class it.univr.di.cstnu.util.OSTNURandomGenerator
- getVersionAndCopyright() - Method in class it.univr.di.cstnu.util.STNURandomGenerator
- getVersionAndDate() - Static method in class it.univr.di.cstnu.algorithms.PSTN
- getVersionAndDate() - Static method in class it.univr.di.cstnu.algorithms.STNU
- getVertexCount() - Method in class it.univr.di.cstnu.graph.TNGraph
- getVertexSupport() - Method in class it.univr.di.cstnu.visualization.EditingGraphMousePlugin
- getVertices() - Method in class it.univr.di.cstnu.graph.TNGraph
- getVerticesArray() - Method in class it.univr.di.cstnu.graph.TNGraph
-
getVerticesArray.
- getX() - Method in class it.univr.di.cstnu.graph.LabeledNode
- getY() - Method in class it.univr.di.cstnu.graph.LabeledNode
- getZ() - Method in class it.univr.di.cstnu.graph.TNGraph
- getZ() - Method in class it.univr.di.cstnu.graph.TNPredecessorGraph
- GLOBAL_HEADER - Static variable in class it.univr.di.cstnu.util.Checker
-
Global header
- GLOBAL_HEADER - Static variable in class it.univr.di.cstnu.util.DispatchabilityBenchmarkRunner
-
Global header
- GLOBAL_HEADER - Static variable in class it.univr.di.cstnu.util.PSTNRTEBenchmarkRunner
-
Global header
- GLOBAL_HEADER - Static variable in class it.univr.di.cstnu.util.SRNCFinderBenchmarkRunner
-
Global header
- GLOBAL_HEADER - Static variable in class it.univr.di.cstnu.util.STNURTEBenchmarkRunner
-
Global header
- GLOBAL_HEADER_ROW - Static variable in class it.univr.di.cstnu.util.Checker
- GLOBAL_HEADER_ROW - Static variable in class it.univr.di.cstnu.util.DispatchabilityBenchmarkRunner
- GLOBAL_HEADER_ROW - Static variable in class it.univr.di.cstnu.util.PSTNRTEBenchmarkRunner
- GLOBAL_HEADER_ROW - Static variable in class it.univr.di.cstnu.util.SRNCFinderBenchmarkRunner
- GLOBAL_HEADER_ROW - Static variable in class it.univr.di.cstnu.util.STNURTEBenchmarkRunner
- GlobalStatisticKey(int, int, int) - Constructor for class it.univr.di.cstnu.util.Checker.GlobalStatisticKey
-
default constructor
- GRAPH_NAME_KEY - Static variable in class it.univr.di.cstnu.graph.TNGraphMLWriter
- GRAPH_nCTG_KEY - Static variable in class it.univr.di.cstnu.graph.TNGraphMLWriter
- GRAPH_nEDGES_KEY - Static variable in class it.univr.di.cstnu.graph.TNGraphMLWriter
- GRAPH_nOBS_KEY - Static variable in class it.univr.di.cstnu.graph.TNGraphMLWriter
- GRAPH_nVERTICES_KEY - Static variable in class it.univr.di.cstnu.graph.TNGraphMLWriter
- GraphAlgs - Interface in it.univr.di.cstnu.util
-
Utility class containing some graph algorithm implementations.
- GraphDistances - Interface in it.univr.di.cstnu.util
-
This interface defines the methods for managing distances between nodes in a graph.
- GraphDistancesImpl - Class in it.univr.di.cstnu.util
-
Implementation based on two nested hash maps.
- GraphDistancesImpl() - Constructor for class it.univr.di.cstnu.util.GraphDistancesImpl
-
Default constructor
- graphInfoLabel - Variable in class it.univr.di.cstnu.visualization.TNEditor
-
The graph info label
- GraphML2Luke - Class in it.univr.di.cstnu.util
-
Utility class for converting STNU file in GraphML format to Luke format.
- GraphML2Luke() - Constructor for class it.univr.di.cstnu.util.GraphML2Luke
- graphMouse - Variable in class it.univr.di.cstnu.visualization.EditingModalGraphMouse.ModeKeyAdapter
- growFactor - Static variable in class it.univr.di.cstnu.graph.TNGraph
-
Adjacency grow factor: This represents the multiplication factor used to increase the dimension of the adjacency matrix.
H
- halfFinished - Enum constant in enum class it.univr.di.cstnu.algorithms.STNU.ElementStatus
- handlePopup(MouseEvent) - Method in class it.univr.di.cstnu.visualization.EditingPopupGraphMousePlugin
- hashCode() - Method in class it.univr.di.cstnu.algorithms.CSTNPSU.PrototypalLink
- hashCode() - Method in record class it.univr.di.cstnu.algorithms.STNU.ActivationDistanceInfo
-
Returns a hash code value for this object.
- hashCode() - Method in record class it.univr.di.cstnu.algorithms.STNU.DistancePair
-
Returns a hash code value for this object.
- hashCode() - Method in record class it.univr.di.cstnu.algorithms.STNU.STNUCheckStatus.SRNCInfo
-
Returns a hash code value for this object.
- hashCode() - Method in record class it.univr.di.cstnu.algorithms.STNURTE.ContingentLink
-
Returns a hash code value for this object.
- hashCode() - Method in record class it.univr.di.cstnu.algorithms.STNURTE.NodeEnabledInTimeInterval
-
Returns a hash code value for this object.
- hashCode() - Method in record class it.univr.di.cstnu.algorithms.STNURTE.NodeOccurrence
-
Returns a hash code value for this object.
- hashCode() - Method in record class it.univr.di.cstnu.algorithms.STNURTE.NodeWithTimeInterval
-
Returns a hash code value for this object.
- hashCode() - Method in class it.univr.di.cstnu.graph.AbstractComponent
- hashCode() - Method in class it.univr.di.cstnu.graph.BasicCSTNUEdgePluggable.InternalEntry
- hashCode() - Method in interface it.univr.di.cstnu.graph.Component
- hashCode() - Method in class it.univr.di.cstnu.graph.STNUEdge.CaseLabel
- hashCode() - Method in class it.univr.di.cstnu.util.Checker.GlobalStatisticKey
- hashCode() - Method in class it.univr.di.cstnu.util.ObjectPair
- hashCode() - Method in record class it.univr.di.cstnu.util.OptimizationEngine.OptimizationResult
-
Returns a hash code value for this object.
- hashCode() - Method in record class it.univr.di.cstnu.util.PSTNRTEBenchmarkRunner.PSTNSituation
-
Returns a hash code value for this object.
- hashCode() - Method in class it.univr.di.labeledvalue.AbstractLabeledIntMap
- hashCode() - Method in class it.univr.di.labeledvalue.ALabel.EmptyLabel
- hashCode() - Method in class it.univr.di.labeledvalue.ALabel
- hashCode() - Method in class it.univr.di.labeledvalue.ALabelAlphabet.ALetter
- hashCode() - Method in class it.univr.di.labeledvalue.Label
- hashCode() - Method in class it.univr.di.labeledvalue.LabeledALabelIntTreeMap
- hashCode() - Method in class it.univr.di.labeledvalue.LabeledIntHierarchyMap.HierarchyNode
- hashCode() - Method in class it.univr.di.labeledvalue.LabeledLowerCaseValue
- hashCode() - Method in class it.univr.di.labeledvalue.Literal
- hashCode(char, char) - Static method in class it.univr.di.labeledvalue.Literal
-
Hash code for a literal given as char
c
and statestate
. - hasNameEquals(ALabelAlphabet.ALetter) - Method in class it.univr.di.cstnu.graph.LabeledNode
- hasSameEdgesOf(TNGraph<E>) - Method in class it.univr.di.cstnu.graph.TNGraph
-
Returns true if this graph has the same set of edges as g1.
- hasSameValues(Edge) - Method in class it.univr.di.cstnu.graph.BasicCSTNUEdgePluggable
- hasSameValues(Edge) - Method in class it.univr.di.cstnu.graph.CSTNEdgePluggable
- hasSameValues(Edge) - Method in class it.univr.di.cstnu.graph.CSTNPSUEdgePluggable
- hasSameValues(Edge) - Method in class it.univr.di.cstnu.graph.CSTNUEdgePluggable
- hasSameValues(Edge) - Method in interface it.univr.di.cstnu.graph.Edge
- hasSameValues(Edge) - Method in class it.univr.di.cstnu.graph.STNEdgeInt
- hasSameValues(Edge) - Method in class it.univr.di.cstnu.graph.STNUEdgeInt
- hasSameVerticesOf(TNGraph<E>) - Method in class it.univr.di.cstnu.graph.TNGraph
- HierarchyNode(Label, int) - Constructor for class it.univr.di.labeledvalue.LabeledIntHierarchyMap.HierarchyNode
- HOPS - Static variable in class it.univr.di.cstnu.util.STNUDensifier
-
Default hops
- horizon - Variable in class it.univr.di.cstnu.algorithms.AbstractCSTN
-
Horizon value.
- horizon - Variable in class it.univr.di.cstnu.algorithms.STN
-
Horizon value.
- HunsbergerPosenato18 - Enum constant in enum class it.univr.di.cstnu.algorithms.AbstractCSTN.CheckAlgorithm
-
Hunsberger Posenato 2018.
- HunsbergerPosenato19 - Enum constant in enum class it.univr.di.cstnu.algorithms.AbstractCSTN.CheckAlgorithm
-
Hunsberger Posenato 2019 It is selected when
AbstractCSTN.setPropagationOnlyToZ(boolean)
with false value is executed before the execution ofCSTN.dynamicConsistencyCheck()
- HunsbergerPosenato20 - Enum constant in enum class it.univr.di.cstnu.algorithms.AbstractCSTN.CheckAlgorithm
-
Hunsberger Posenato 2020.
I
- inDegree(LabeledNode) - Method in class it.univr.di.cstnu.graph.TNGraph
- index(char) - Static method in class it.univr.di.labeledvalue.Literal
- index(ALabelAlphabet.ALetter) - Method in class it.univr.di.labeledvalue.ALabelAlphabet
- INFINITY_SYMBOL - Static variable in class it.univr.di.labeledvalue.Constants
-
Char representing infinity symbol: ∞.
- INFINITY_SYMBOLstring - Static variable in class it.univr.di.labeledvalue.Constants
- INFO_ICON_FILE - Static variable in class it.univr.di.cstnu.visualization.TNEditor
- init() - Method in class it.univr.di.cstnu.visualization.TNEditor
-
Initialize all other components of the GUI using the parameter values passed.
- initAndCheck() - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN
-
Checks and initializes the CSTN instance represented by graph
g
. - initAndCheck() - Method in class it.univr.di.cstnu.algorithms.CSTNPotential
-
Checks and initializes the CSTN instance represented by graph
g
. - initAndCheck() - Method in class it.univr.di.cstnu.algorithms.CSTNPSU
-
Calls
AbstractCSTN.coreCSTNInitAndCheck()
and, then, check all guarded links. - initAndCheck() - Method in class it.univr.di.cstnu.algorithms.CSTNU
-
Checks and initializes the CSTN instance represented by graph
g
. - initAndCheck() - Method in class it.univr.di.cstnu.algorithms.OSTNU
-
Checks and initializes the CSTN instance represented by graph
g
. - initAndCheck() - Method in class it.univr.di.cstnu.algorithms.PCSTNU
-
Checks and initializes the CSTN instance represented by graph
g
. - initAndCheck() - Method in class it.univr.di.cstnu.algorithms.PSTN
-
Makes the PSTN check and initialization.
- initAndCheck() - Method in class it.univr.di.cstnu.algorithms.STN
-
Initializes the STN instance represented by graph g.
- initAndCheck() - Method in class it.univr.di.cstnu.algorithms.STNU
-
Makes the STNU check and initialization.
- INITIAL_CAPACITY - Static variable in class it.univr.di.cstnu.util.ObjectArrayFIFOSetQueue
-
The standard initial capacity of a queue.
- initialize() - Method in class it.univr.di.cstnu.visualization.CSTNLayout
- initialize() - Method in class it.univr.di.cstnu.visualization.CSTNUStaticLayout
-
It has been erased.
- initialized - Variable in class it.univr.di.cstnu.algorithms.STN.STNCheckStatus
-
Becomes true when all data structures have been initialized.
- inNegativeCycle() - Method in class it.univr.di.cstnu.graph.AbstractComponent
- inNegativeCycle() - Method in interface it.univr.di.cstnu.graph.Component
- INPUT_GRAPH_BIG_VIEWER_NAME - Static variable in class it.univr.di.cstnu.visualization.TNEditor
-
Name of the input graph Big Viewer
- inputGraph - Variable in class it.univr.di.cstnu.visualization.TNEditor
-
Necessary TNGraph structure to represent the input graph.
- inputGraphBiggerViewer - Variable in class it.univr.di.cstnu.visualization.TNEditor
-
Button for a bigger input-network viewer
- insertOrUpdate(T, int) - Method in class it.univr.di.cstnu.util.ExtendedPriorityQueue
-
Inserts or updates the given item and its priority into this heap.
- INSTANCE - Enum constant in enum class it.univr.di.Debug
-
A class containing just a static constant can be represented as an enum.
- INT_NEG_INFINITE - Static variable in class it.univr.di.labeledvalue.Constants
-
The integer value representing the -∞.
- INT_NULL - Static variable in class it.univr.di.labeledvalue.Constants
-
Default value to represent an invalid integer value.
- INT_POS_INFINITE - Static variable in class it.univr.di.labeledvalue.Constants
-
The integer value representing the +∞.
- internal - Enum constant in enum class it.univr.di.cstnu.graph.Edge.ConstraintType
-
The edge represents an internal one used to represent a high-level construct, such as a WORKFLOW OR JOIN.
- InternalEntry(Label, ALabel) - Constructor for class it.univr.di.cstnu.graph.BasicCSTNUEdgePluggable.InternalEntry
- interruptBy - Variable in class it.univr.di.cstnu.algorithms.STNU.RULGlobalInfo
-
InterruptBy maintains, for each UC edge E, the possible pair (UCEdge E', STNUPath P') where E' is the UC edge that interrupted the bypass procedure for E (
STNU.SRNCycleFinderBackPropagation(STNUEdge, RULGlobalInfo)
. - interruptionCycle - Enum constant in enum class it.univr.di.cstnu.algorithms.STNU.STNUCheckStatus.SRNCKind
-
A negative cycle was found because the propagation interruption sequence went back to a previous contingent node.
- intersect(int, int) - Method in class it.univr.di.cstnu.util.TimeInterval
- intersect(TimeInterval) - Method in class it.univr.di.cstnu.util.TimeInterval
- intersect(ALabel) - Method in class it.univr.di.labeledvalue.ALabel
- IR - Enum constant in enum class it.univr.di.cstnu.algorithms.AbstractCSTN.DCSemantics
-
Instantaneous reaction semantics
- isActivationNode(LabeledNode) - Method in class it.univr.di.cstnu.algorithms.CSTNU
- isAllMaxMinimalGraphConsistent(TNGraph<OSTNUEdgePluggable>) - Method in class it.univr.di.cstnu.algorithms.OSTNU
-
Determines the minimal distance between all pairs of vertices of the given graph if the graph is consistent, i.e., it does not contain any negative cycles.
- isAnEndingNode(String) - Static method in class it.univr.di.cstnu.visualization.CSTNLayout
- isAStartingNode(String) - Static method in class it.univr.di.cstnu.visualization.CSTNLayout
- isAViableSchedule(Object2IntMap<LabeledNode>, boolean) - Method in class it.univr.di.cstnu.algorithms.STNURTE
-
Verifies that the given schedule does not violate any constraints.
- isCleanedOutputRequired() - Method in class it.univr.di.cstnu.algorithms.STNU
- isComplement(Literal) - Method in class it.univr.di.labeledvalue.Literal
- isConsistentWith(byte, char) - Method in class it.univr.di.labeledvalue.Label
-
A literal l is consistent with a label if the last one does not contain ¬l.
- isConsistentWith(Label) - Method in class it.univr.di.labeledvalue.Label
-
A label L1 is consistent with a label L2 if L1 ∧ L2 is satisfiable.
- isConsistentWith(Literal) - Method in class it.univr.di.labeledvalue.Label
- isContingent - Variable in class it.univr.di.cstnu.graph.LabeledNode
-
Flag for the contingent node.
- isContingent() - Method in class it.univr.di.cstnu.graph.LabeledNode
- isContingent() - Method in interface it.univr.di.cstnu.graph.Node
- isContingentAlsoAsOrdinary() - Method in class it.univr.di.cstnu.algorithms.CSTNU
- isContingentAlsoAsOrdinary() - Method in class it.univr.di.cstnu.algorithms.STNU
- isContingentEdge() - Method in interface it.univr.di.cstnu.graph.Edge
- isControllable() - Method in class it.univr.di.cstnu.algorithms.CSTNU.CSTNUCheckStatus
- isControllable() - Method in class it.univr.di.cstnu.algorithms.OSTNU.OSTNUCheckStatus
- isControllable() - Method in class it.univr.di.cstnu.algorithms.STNU.STNUCheckStatus
- isCSTNEdge() - Method in class it.univr.di.cstnu.graph.AbstractEdge
- isCSTNEdge() - Method in class it.univr.di.cstnu.graph.CSTNEdgePluggable
- isCSTNEdge() - Method in interface it.univr.di.cstnu.graph.Edge
-
This method is inappropriate here, but it helps to speed up the code.
- isCSTNPSUEdge() - Method in class it.univr.di.cstnu.graph.AbstractEdge
- isCSTNPSUEdge() - Method in class it.univr.di.cstnu.graph.CSTNPSUEdgePluggable
- isCSTNPSUEdge() - Method in interface it.univr.di.cstnu.graph.Edge
-
This method is inappropriate here, but it helps to speed up the code.
- isCSTNUEdge() - Method in class it.univr.di.cstnu.graph.AbstractEdge
- isCSTNUEdge() - Method in class it.univr.di.cstnu.graph.CSTNUEdgePluggable
- isCSTNUEdge() - Method in interface it.univr.di.cstnu.graph.Edge
-
This method is inappropriate here, but it helps to speed up the code.
- isDest(LabeledNode, E) - Method in class it.univr.di.cstnu.graph.TNGraph
- isEmpty() - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN.NodesToCheck
- isEmpty() - Method in class it.univr.di.cstnu.graph.BasicCSTNUEdgePluggable
- isEmpty() - Method in class it.univr.di.cstnu.graph.CSTNEdgePluggable
- isEmpty() - Method in class it.univr.di.cstnu.graph.CSTNPSUEdgePluggable
- isEmpty() - Method in class it.univr.di.cstnu.graph.CSTNUEdgePluggable
- isEmpty() - Method in interface it.univr.di.cstnu.graph.Edge
- isEmpty() - Method in class it.univr.di.cstnu.graph.STNEdgeInt
- isEmpty() - Method in class it.univr.di.cstnu.graph.STNUEdgeInt
- isEmpty() - Method in class it.univr.di.cstnu.util.ExtendedPriorityQueue
-
It runs in O(1) time.
- isEmpty() - Method in class it.univr.di.cstnu.util.ObjectArrayFIFOSetQueue
- isEmpty() - Method in class it.univr.di.cstnu.util.ObjectPair
- isEmpty() - Method in class it.univr.di.labeledvalue.AbstractLabeledIntMap
- isEmpty() - Method in class it.univr.di.labeledvalue.ALabel.EmptyLabel
- isEmpty() - Method in class it.univr.di.labeledvalue.ALabel
- isEmpty() - Method in class it.univr.di.labeledvalue.ALabelAlphabet
- isEmpty() - Method in class it.univr.di.labeledvalue.Label
- isEmpty() - Method in class it.univr.di.labeledvalue.LabeledALabelIntTreeMap
- isEmpty() - Method in interface it.univr.di.labeledvalue.LabeledIntMap
- isEmpty() - Method in class it.univr.di.labeledvalue.LabeledLowerCaseValue
- isInNegativeScenarios(Label) - Method in class it.univr.di.cstnu.algorithms.OSTNU.OSTNUCheckStatus
-
Checks if the label belongs to the negative scenarios.
- isLower() - Method in class it.univr.di.cstnu.graph.STNUEdge.CaseLabel
- isLowerCase() - Method in interface it.univr.di.cstnu.graph.STNUEdge
- isNegated() - Method in class it.univr.di.labeledvalue.Literal
- isNodePresent(LabeledNode) - Method in class it.univr.di.cstnu.graph.TNPredecessorGraph
- isObserver() - Method in class it.univr.di.cstnu.graph.LabeledNode
- isOrdinaryEdge() - Method in interface it.univr.di.cstnu.graph.STNUEdge
- isOSTNUEdge() - Method in class it.univr.di.cstnu.graph.AbstractEdge
- isOSTNUEdge() - Method in interface it.univr.di.cstnu.graph.Edge
-
This method is inappropriate here, but it helps to speed up the code.
- isOutputCleaned() - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN
- isOutputCleaned() - Method in class it.univr.di.cstnu.algorithms.STN
- isParameter - Variable in class it.univr.di.cstnu.graph.LabeledNode
-
Flag for parameter node.
- isParameter() - Method in class it.univr.di.cstnu.graph.LabeledNode
- isParameter() - Method in interface it.univr.di.cstnu.graph.Node
- isPresent - Enum constant in enum class it.univr.di.cstnu.util.ExtendedPriorityQueue.Status
-
The element is currently in the queue.
- isRequirementEdge() - Method in interface it.univr.di.cstnu.graph.Edge
- isSave() - Method in class it.univr.di.cstnu.algorithms.PSTN
- isSave() - Method in class it.univr.di.cstnu.algorithms.STNU
- isSource(LabeledNode, E) - Method in class it.univr.di.cstnu.graph.TNGraph
- isSTNEdge() - Method in class it.univr.di.cstnu.graph.AbstractEdge
- isSTNEdge() - Method in interface it.univr.di.cstnu.graph.Edge
-
This method is inappropriate here, but it helps to speed up the code.
- isSTNEdge() - Method in class it.univr.di.cstnu.graph.STNEdgeInt
- isSTNEdge() - Method in class it.univr.di.cstnu.graph.STNUEdgeInt
- isSTNUEdge() - Method in class it.univr.di.cstnu.graph.AbstractEdge
- isSTNUEdge() - Method in interface it.univr.di.cstnu.graph.Edge
-
This method is inappropriate here, but it helps to speed up the code.
- isSTNUEdge() - Method in class it.univr.di.cstnu.graph.STNUEdgeInt
- isStraight() - Method in class it.univr.di.labeledvalue.Literal
- isUnknown() - Method in class it.univr.di.labeledvalue.Literal
- isUpper() - Method in class it.univr.di.cstnu.graph.STNUEdge.CaseLabel
- isUpperBoundRequested - Variable in class it.univr.di.cstnu.algorithms.CSTNPotential
-
True if the DC checking algorithm must also determine the maximum execution time for each time-point.
- isUpperBoundRequested() - Method in class it.univr.di.cstnu.algorithms.CSTNPotential
- isUpperCase() - Method in interface it.univr.di.cstnu.graph.STNUEdge
- isVersionReq() - Method in class it.univr.di.cstnu.algorithms.PSTN
- isVersionReq() - Method in class it.univr.di.cstnu.algorithms.STNU
- isWait() - Method in class it.univr.di.cstnu.algorithms.STNURTE.RTED
- isWait() - Method in interface it.univr.di.cstnu.graph.STNUEdge
- isWithinBounds() - Method in record class it.univr.di.cstnu.util.PSTNRTEBenchmarkRunner.PSTNSituation
- isWithNodeLabels() - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN
- it.univr.di - package it.univr.di
-
Contains the two packages that realize the framework for verifying the consistency/controllability of temporal constraint networks.
- it.univr.di.cstnu.algorithms - package it.univr.di.cstnu.algorithms
-
Contains all checking algorithms for (C)STN(U)s.
- it.univr.di.cstnu.graph - package it.univr.di.cstnu.graph
-
Contains all classes for representing vertices, edges and graphs related to the (C)STN(U) model.
- it.univr.di.cstnu.util - package it.univr.di.cstnu.util
-
Contains all actor classes for the implementation and/or the use of (C)STN(U)s algorithms.
- it.univr.di.cstnu.visualization - package it.univr.di.cstnu.visualization
-
Contains all classes to implement a simple graphical editor for (C)STN(U)s instances.
- it.univr.di.labeledvalue - package it.univr.di.labeledvalue
-
Provides the classes necessary to manage labeled value maps.
- iterator() - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN.EdgesToCheck
- iterator() - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN.NodesToCheck
- iterator() - Method in class it.univr.di.cstnu.util.ObjectArrayFIFOSetQueue
- iterator() - Method in class it.univr.di.cstnu.util.ObjectPair
- iterator() - Method in class it.univr.di.labeledvalue.ALabel.EmptyLabel
- iterator() - Method in class it.univr.di.labeledvalue.ALabel
J
- Johnson - Enum constant in enum class it.univr.di.cstnu.algorithms.STN.CheckAlgorithm
-
Johnson
K
- keySet() - Method in class it.univr.di.labeledvalue.LabeledIntHierarchyMap
- keySet() - Method in interface it.univr.di.labeledvalue.LabeledIntMap
-
A copy of all labels in the map.
- keySet() - Method in class it.univr.di.labeledvalue.LabeledIntSimpleMap
-
Deprecated.
- keySet() - Method in class it.univr.di.labeledvalue.LabeledIntTreeMap
- keyTyped(KeyEvent) - Method in class it.univr.di.cstnu.visualization.EditingModalGraphMouse.ModeKeyAdapter
L
- label - Variable in class it.univr.di.cstnu.graph.BasicCSTNUEdgePluggable.InternalEntry
- label - Variable in class it.univr.di.labeledvalue.LabeledIntHierarchyMap.HierarchyNode
- Label - Class in it.univr.di.labeledvalue
-
Represents an immutable propositional label in the CSTN/CSTNU framework.
- LABEL_RE - Static variable in class it.univr.di.labeledvalue.Label
-
Regular expression representing a Label.
- labelCharsRE - Static variable in class it.univr.di.labeledvalue.LabeledALabelIntTreeMap
-
Keyword \w because it is necessary to accept also node names!
- LABELED - Enum constant in enum class it.univr.di.cstnu.graph.LabeledNode.Status
- LabeledALabelIntTreeMap - Class in it.univr.di.labeledvalue
-
Allows managing conjoined upper-case values that are also associated with propositional labels.
- LabeledALabelIntTreeMap(LabeledALabelIntTreeMap, Class<? extends LabeledIntMap>) - Constructor for class it.univr.di.labeledvalue.LabeledALabelIntTreeMap
-
Constructor to clone the structure.
- LabeledALabelIntTreeMap(Class<? extends LabeledIntMap>) - Constructor for class it.univr.di.labeledvalue.LabeledALabelIntTreeMap
-
Simple constructor.
- LabeledALabelIntTreeMap.LabeledALabelIntTreeMapView - Class in it.univr.di.labeledvalue
-
A read-only view of a LabeledALabelIntTreeMap object.
- LabeledALabelIntTreeMapView(LabeledALabelIntTreeMap) - Constructor for class it.univr.di.labeledvalue.LabeledALabelIntTreeMap.LabeledALabelIntTreeMapView
- labeledCrossCaseRule(LabeledNode, LabeledNode, LabeledNode, OSTNUEdgePluggable, OSTNUEdgePluggable, OSTNUEdgePluggable) - Method in class it.univr.di.cstnu.algorithms.OSTNU
-
Labeled Cross-Case Rule
- labeledCrossLowerCaseRule(LabeledNode, LabeledNode, LabeledNode, CSTNUEdge, CSTNUEdge, CSTNUEdge) - Method in class it.univr.di.cstnu.algorithms.CSTNU
-
Labeled Cross-Lower Case (zLc/CC)
- labeledCrossLowerCaseRule(LabeledNode, LabeledNode, LabeledNode, CSTNUEdge, CSTNUEdge, CSTNUEdge) - Method in class it.univr.di.cstnu.algorithms.PCSTNU
-
Apply B and B-parameter rules of the paper about Parameter-CSTNU.
- LabeledIntHierarchyMap - Class in it.univr.di.labeledvalue
-
Simple implementation of
LabeledIntMap
interface. - LabeledIntHierarchyMap() - Constructor for class it.univr.di.labeledvalue.LabeledIntHierarchyMap
-
Necessary constructor for the factory.
- LabeledIntHierarchyMap(LabeledIntMap) - Constructor for class it.univr.di.labeledvalue.LabeledIntHierarchyMap
-
Constructor to clone the structure.
- LabeledIntHierarchyMap.HierarchyNode - Class in it.univr.di.labeledvalue
-
Simple class to represent a labeled value in the hierarchy.
- LabeledIntHierarchyMap.LabeledIntHierarchyMapView - Class in it.univr.di.labeledvalue
-
A read-only view of an object
- LabeledIntHierarchyMapView(LabeledIntHierarchyMap) - Constructor for class it.univr.di.labeledvalue.LabeledIntHierarchyMap.LabeledIntHierarchyMapView
- LabeledIntMap - Interface in it.univr.di.labeledvalue
-
Realizes the map
Label
-->int - LabeledIntMap.LabeledIntMapView - Interface in it.univr.di.labeledvalue
-
A read-only view of an object
- LabeledIntMapSupplier<C> - Class in it.univr.di.labeledvalue
-
Basic factory of LabeledIntMap objects.
- LabeledIntMapSupplier(Class<C>) - Constructor for class it.univr.di.labeledvalue.LabeledIntMapSupplier
-
Constructor for LabeledIntMapSupplier.
- LabeledIntNotMinMapView(LabeledIntSimpleMap) - Constructor for class it.univr.di.labeledvalue.LabeledIntSimpleMap.LabeledIntNotMinMapView
-
Deprecated.
- LabeledIntSimpleMap - Class in it.univr.di.labeledvalue
-
Deprecated.
- LabeledIntSimpleMap() - Constructor for class it.univr.di.labeledvalue.LabeledIntSimpleMap
-
Deprecated.Necessary constructor for the factory.
- LabeledIntSimpleMap(boolean) - Constructor for class it.univr.di.labeledvalue.LabeledIntSimpleMap
-
Deprecated.Necessary constructor for the factory.
- LabeledIntSimpleMap(LabeledIntMap) - Constructor for class it.univr.di.labeledvalue.LabeledIntSimpleMap
-
Deprecated.Constructor to clone the structure.
- LabeledIntSimpleMap(LabeledIntMap, boolean) - Constructor for class it.univr.di.labeledvalue.LabeledIntSimpleMap
-
Deprecated.Constructor to clone the structure.
- LabeledIntSimpleMap.LabeledIntNotMinMapView - Class in it.univr.di.labeledvalue
-
Deprecated.
- LabeledIntTreeMap - Class in it.univr.di.labeledvalue
-
Simple implementation of
LabeledIntMap
interface. - LabeledIntTreeMap() - Constructor for class it.univr.di.labeledvalue.LabeledIntTreeMap
-
Necessary constructor for the factory.
- LabeledIntTreeMap(boolean) - Constructor for class it.univr.di.labeledvalue.LabeledIntTreeMap
-
Necessary constructor for the factory.
- LabeledIntTreeMap(LabeledIntMap) - Constructor for class it.univr.di.labeledvalue.LabeledIntTreeMap
-
Constructor to clone the structure.
- LabeledIntTreeMap(LabeledIntMap, boolean) - Constructor for class it.univr.di.labeledvalue.LabeledIntTreeMap
-
Constructor to clone the structure.
- LabeledIntTreeMap.LabeledIntTreeMapView - Class in it.univr.di.labeledvalue
-
A read-only view of an object
- LabeledIntTreeMapView(LabeledIntTreeMap) - Constructor for class it.univr.di.labeledvalue.LabeledIntTreeMap.LabeledIntTreeMapView
- LabeledIntTreeSimpleMap - Class in it.univr.di.labeledvalue
-
Extends LabeledIntTreeMap, setting optimize field to false.
In this way, labeled values where labels are not shortened.
This class is useful for the OSTNUPluggableEdge class. - LabeledIntTreeSimpleMap() - Constructor for class it.univr.di.labeledvalue.LabeledIntTreeSimpleMap
-
Necessary constructor for the factory.
- LabeledIntTreeSimpleMap(boolean) - Constructor for class it.univr.di.labeledvalue.LabeledIntTreeSimpleMap
-
Necessary constructor for the factory.
- LabeledIntTreeSimpleMap(LabeledIntMap, boolean) - Constructor for class it.univr.di.labeledvalue.LabeledIntTreeSimpleMap
-
Constructor to clone the structure.
- labelEditingPlugin - Variable in class it.univr.di.cstnu.visualization.EditingModalGraphMouse
- labeledLetterRemovalRule(LabeledNode, LabeledNode, CSTNUEdge) - Method in class it.univr.di.cstnu.algorithms.CSTNU
-
Labeled Letter Removal (Lr)
- labeledLetterRemovalRule(LabeledNode, LabeledNode, OSTNUEdgePluggable) - Method in class it.univr.di.cstnu.algorithms.OSTNU
-
Labeled Letter Removal Since this algorithm does not manage if two contingent timepoints have a strict range, and they require oracles, one way to capture such a situation is to not remove the letter to a wait when X is an activation or contingent time point.
- labeledLowerCaseRule(LabeledNode, LabeledNode, LabeledNode, OSTNUEdgePluggable, OSTNUEdgePluggable, OSTNUEdgePluggable) - Method in class it.univr.di.cstnu.algorithms.OSTNU
-
Labeled Lower Case Rule
- LabeledLowerCaseValue - Class in it.univr.di.labeledvalue
-
Represents an immutable Labeled Lower Case value.
- LabeledNode - Class in it.univr.di.cstnu.graph
-
LabeledNode class.
- LabeledNode(LabeledNode) - Constructor for class it.univr.di.cstnu.graph.LabeledNode
-
Constructor for cloning.
- LabeledNode(String) - Constructor for class it.univr.di.cstnu.graph.LabeledNode
-
Constructor for LabeledNode.
- LabeledNode(String, char) - Constructor for class it.univr.di.cstnu.graph.LabeledNode
-
Standard constructor for an observation node
- LabeledNode.Status - Enum Class in it.univr.di.cstnu.graph
-
Possible status of a node during the execution of some visiting algorithms.
- LabeledNodeSupplier - Class in it.univr.di.cstnu.graph
-
LabeledIntEdgePluggable supplier.
- LabeledNodeSupplier() - Constructor for class it.univr.di.cstnu.graph.LabeledNodeSupplier
- labeledOracleRule(LabeledNode, LabeledNode, LabeledNode, OSTNUEdgePluggable, OSTNUEdgePluggable, OSTNUEdgePluggable) - Method in class it.univr.di.cstnu.algorithms.OSTNU
-
Oracle rule.
- labeledPotentialCount - Variable in class it.univr.di.cstnu.graph.LabeledNode
-
Labeled potential count.
- labeledPropagationRule(LabeledNode, LabeledNode, LabeledNode, OSTNUEdgePluggable, OSTNUEdgePluggable, OSTNUEdgePluggable) - Method in class it.univr.di.cstnu.algorithms.OSTNU
-
Applies 'labeled no case' or 'labeled upper case propagation' rules.
- labeledUpperCaseRule(LabeledNode, LabeledNode, LabeledNode, OSTNUEdgePluggable, OSTNUEdgePluggable, OSTNUEdgePluggable) - Method in class it.univr.di.cstnu.algorithms.OSTNU
-
Applies 'labeled upper case' rules.
- labeledValue - Variable in class it.univr.di.cstnu.graph.CSTNEdgePluggable
-
Labeled value.
- labeledValue - Variable in class it.univr.di.cstnu.graph.STNUEdgeInt
-
The labeled value associated with the edge when it is a contingent link or a wait constraint.
- labeledValueMapImpl - Variable in class it.univr.di.cstnu.graph.CSTNEdgePluggable
-
Labeled value class used in the class.
- labeledValueMapImpl - Static variable in class it.univr.di.cstnu.graph.LabeledNode
-
Labeled value class used in the class.
- labeledValueMapImpl - Static variable in class it.univr.di.cstnu.graph.TNGraphMLReader
-
Labeled value class used in the class.
- labeledValuePropagationCalls - Variable in class it.univr.di.cstnu.algorithms.AbstractCSTN.CSTNCheckStatus
-
Counters #applications of the label propagation rule
- labeledValueRE - Static variable in class it.univr.di.labeledvalue.AbstractLabeledIntMap
-
A labeled value as a regular expression.
- LabeledValueRE - Static variable in class it.univr.di.labeledvalue.Constants
-
Regular expression for an acceptable value in a LabeledValue.
- labeledValuesAsString() - Method in interface it.univr.di.cstnu.graph.CSTNEdge
- labeledValuesAsString() - Method in class it.univr.di.cstnu.graph.CSTNEdgePluggable
- labeledValueSetREPattern - Static variable in class it.univr.di.labeledvalue.AbstractLabeledIntMap
-
Matcher for a set of labeled values.
- LabelInconsistent - Enum constant in enum class it.univr.di.cstnu.algorithms.WellDefinitionException.Type
- labelModificationqR0(LabeledNode, CSTNUEdge) - Method in class it.univr.di.cstnu.algorithms.CSTNU
-
Implements the zqR0 rule assuming instantaneous reaction and a streamlined network.
- labelModificationqR2(LabeledNode, CSTNUEdge) - Method in class it.univr.di.cstnu.algorithms.PCSTNU
-
Apply zR2 rule assuming instantaneous reaction and a streamlined network.
- labelModificationqR3(LabeledNode, CSTNUEdge) - Method in class it.univr.di.cstnu.algorithms.CSTNU
-
Implements the qR3* rule assuming instantaneous reaction and a streamlined network.
- labelModificationR0qR0(LabeledNode, LabeledNode, E) - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN
-
Applies rule R0/qR0: label containing a proposition that can be decided only in the future is simplified by removing such a proposition.
- labelModificationR0qR0Core(LabeledNode, LabeledNode, Label, int) - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN
-
Execute the core of
AbstractCSTN.labelModificationR0qR0(LabeledNode, LabeledNode, CSTNEdge)
. - labelModificationR1(LabeledNode, CSTNUEdge, LabeledNode) - Method in class it.univr.di.cstnu.algorithms.PCSTNU
-
Apply zR1 rule assuming instantaneous reaction and a streamlined network.
- labelModificationR3qR3(LabeledNode, LabeledNode, CSTNEdge) - Method in class it.univr.di.cstnu.algorithms.CSTN
-
Rule R3*
- labelModificationR3qR3(LabeledNode, LabeledNode, CSTNEdge) - Method in class it.univr.di.cstnu.algorithms.CSTNPotential
-
Deprecated.
- LabelNotSubsumes - Enum constant in enum class it.univr.di.cstnu.algorithms.WellDefinitionException.Type
- labelPropagation(LabeledNode, LabeledNode, LabeledNode, CSTNEdge, CSTNEdge, CSTNEdge) - Method in class it.univr.di.cstnu.algorithms.CSTN
-
Applies the labeled propagation rule:
- labelPropagation(LabeledNode, LabeledNode, LabeledNode, CSTNEdge, CSTNEdge, CSTNEdge) - Method in class it.univr.di.cstnu.algorithms.CSTNPotential
-
This version is a restricted version of
CSTN.labelPropagation(LabeledNode, LabeledNode, LabeledNode, CSTNEdge, CSTNEdge, CSTNEdge)
. - labelPropagation(LabeledNode, LabeledNode, LabeledNode, CSTNUEdge, CSTNUEdge, CSTNUEdge) - Method in class it.univr.di.cstnu.algorithms.CSTNU
-
Applies 'labeled no case' and 'labeled upper case' and 'forward labeled upper case' and 'labeled conjunct upper case' rules.
- labelPropagation(LabeledNode, LabeledNode, LabeledNode, CSTNUEdge, CSTNUEdge, CSTNUEdge) - Method in class it.univr.di.cstnu.algorithms.PCSTNU
-
Apply A, A-Parameter, and C rules of the paper about Parameter-CSTNU.
- labelSet() - Method in class it.univr.di.labeledvalue.LabeledALabelIntTreeMap
- labelSet(ALabel) - Method in class it.univr.di.labeledvalue.LabeledALabelIntTreeMap
- labelValidator - Static variable in class it.univr.di.labeledvalue.ALabel
-
Validator for a graphical interface
- labelValidator - Static variable in class it.univr.di.labeledvalue.Label
-
Validator for a graphical interface
- LANES - Static variable in class it.univr.di.cstnu.util.OSTNURandomGenerator
-
Default lane number
- LANES - Static variable in class it.univr.di.cstnu.util.STNURandomGenerator
-
Default lane number
- last() - Method in class it.univr.di.cstnu.util.ObjectArrayFIFOSetQueue
- LATE_EXECUTION_STRATEGY - Enum constant in enum class it.univr.di.cstnu.algorithms.STNURTE.StrategyEnum
-
Returns the maximum possible execution time,
l
, with all nodes that have as last possible execution time, i.e.,u' == l
. - layout - Variable in class it.univr.di.cstnu.graph.TNGraphMLWriter
- layoutEditor - Variable in class it.univr.di.cstnu.visualization.TNEditor
-
Layout for the input graph.
- layoutToggleButton - Variable in class it.univr.di.cstnu.visualization.TNEditor
-
Button for re-layout input graph
- layoutViewer - Variable in class it.univr.di.cstnu.visualization.TNEditor
-
Layout for derived graph.
- LC_LABEL - Static variable in interface it.univr.di.cstnu.graph.STNUEdge
-
Constant
LC_LABEL="LC"
- length - Variable in class it.univr.di.cstnu.util.ObjectArrayFIFOSetQueue
-
The current (cached) length of
ObjectArrayFIFOSetQueue.backingArray
. - length() - Method in record class it.univr.di.cstnu.algorithms.STNU.STNUCheckStatus.SRNCInfo
-
Returns the value of the
length
record component. - letterRemovalRuleCalls - Variable in class it.univr.di.cstnu.algorithms.CSTNU.CSTNUCheckStatus
-
Counts the # of applications of different rules.
- letterRemovalRuleCalls - Variable in class it.univr.di.cstnu.algorithms.OSTNU.OSTNUCheckStatus
-
Counts the # of applications of different rules.
- Literal - Class in it.univr.di.labeledvalue
-
An immutable literal.
- load(Reader, Class<? extends E>) - Method in class it.univr.di.cstnu.graph.TNGraphMLReader
-
Creates the graph object using the given reader to acquire the input.
- loadGraphG(File) - Method in class it.univr.di.cstnu.visualization.TNEditor
-
Loads TNGraph stored in file 'fileName' into attribute this.g.
Be careful! - loadPlugins() - Method in class it.univr.di.cstnu.visualization.EditingModalGraphMouse
-
create the plugins, and load the plugins for TRANSFORMING mode
- localInfoOfContingentNodes - Variable in class it.univr.di.cstnu.algorithms.STNU.RULGlobalInfo
-
Map (contingent-node, localInfo) used by rul2021Dispatchable for adding wait constraints after a successful check
- LOG - Static variable in class it.univr.di.cstnu.algorithms.PCSTNU
-
logger
- LOG - Static variable in class it.univr.di.cstnu.graph.CSTNEdgePluggable
-
logger
- LOG - Static variable in interface it.univr.di.cstnu.graph.STNUEdge
-
logger
- LOG - Static variable in class it.univr.di.cstnu.graph.TNGraphMLReader
-
logger
- LOG - Static variable in class it.univr.di.cstnu.graph.TNGraphMLWriter
-
logger
- LOG - Static variable in class it.univr.di.cstnu.util.Checker
-
class logger
- LOG - Static variable in class it.univr.di.cstnu.util.CSTNRandomGenerator
-
logger
- LOG - Static variable in class it.univr.di.cstnu.util.CSTNU2CSTNPSU
-
logger
- LOG - Static variable in class it.univr.di.cstnu.util.CSTNU2UppaalTiga
-
class logger
- LOG - Static variable in class it.univr.di.cstnu.util.DispatchabilityBenchmarkRunner
-
class logger
- LOG - Static variable in interface it.univr.di.cstnu.util.GraphAlgs
-
Logger for the default method
- LOG - Static variable in class it.univr.di.cstnu.util.GraphML2Luke
-
class logger
- LOG - Static variable in class it.univr.di.cstnu.util.Luke2GraphML
-
class logger
- LOG - Static variable in class it.univr.di.cstnu.util.OSTNURandomGenerator
-
logger
- LOG - Static variable in class it.univr.di.cstnu.util.PSTNRTEBenchmarkRunner
-
class logger
- LOG - Static variable in class it.univr.di.cstnu.util.SRNCFinderBenchmarkRunner
-
class logger
- LOG - Static variable in class it.univr.di.cstnu.util.STNUDensifier
-
logger
- LOG - Static variable in class it.univr.di.cstnu.util.STNURandomGenerator
-
logger
- LOG - Static variable in class it.univr.di.cstnu.util.STNURTEBenchmarkRunner
-
class logger
- LOG - Static variable in class it.univr.di.cstnu.visualization.CSTNUGraphAttributeEditingMousePlugin
- LOG - Static variable in class it.univr.di.cstnu.visualization.EditingPopupGraphMousePlugin
-
logger
- LOG - Static variable in class it.univr.di.cstnu.visualization.TNEditor
-
class logger
- LogNormalDistributionParameter - Class in it.univr.di.cstnu.util
-
Log-normal distribution.
- LogNormalDistributionParameter(double, double) - Constructor for class it.univr.di.cstnu.util.LogNormalDistributionParameter
- LogNormalDistributionParameter(double, double, int) - Constructor for class it.univr.di.cstnu.util.LogNormalDistributionParameter
- loGraphPotFailure - Enum constant in enum class it.univr.di.cstnu.algorithms.STNU.STNUCheckStatus.SRNCKind
-
A negative cycle was found in the LO-Graph.
- lowerBound() - Method in record class it.univr.di.cstnu.algorithms.STNU.ActivationDistanceInfo
-
Returns the value of the
lowerBound
record component. - lowerBound() - Method in record class it.univr.di.cstnu.algorithms.STNURTE.ContingentLink
-
Returns the value of the
lowerBound
record component. - lowerCaseCount() - Method in record class it.univr.di.cstnu.algorithms.STNU.STNUCheckStatus.SRNCInfo
-
Returns the value of the
lowerCaseCount
record component. - lowerCaseRuleCalls - Variable in class it.univr.di.cstnu.algorithms.CSTNU.CSTNUCheckStatus
-
Counts the # of applications of different rules.
- lowerCaseRuleCalls - Variable in class it.univr.di.cstnu.algorithms.OSTNU.OSTNUCheckStatus
-
Counts the # of applications of different rules.
- lowerCaseValue - Variable in class it.univr.di.cstnu.graph.CSTNUEdgePluggable
-
Morris Lower case value augmented by a propositional label.
- lowerCaseValueAsString() - Method in interface it.univr.di.cstnu.graph.BasicCSTNUEdge
- lowerCaseValueAsString() - Method in class it.univr.di.cstnu.graph.CSTNPSUEdgePluggable
- lowerCaseValueAsString() - Method in class it.univr.di.cstnu.graph.CSTNUEdgePluggable
- lowerCaseValueAsString(ALabel, int, Label) - Static method in class it.univr.di.cstnu.algorithms.CSTNU
- lowerCaseValueAsString(ALabel, int, Label) - Static method in class it.univr.di.cstnu.algorithms.OSTNU
- lowerCaseValues - Variable in class it.univr.di.cstnu.graph.CSTNPSUEdgePluggable
-
Morris Lower case value augmented by a propositional label.
- lowerCaseValueSize() - Method in interface it.univr.di.cstnu.graph.BasicCSTNUEdge
- lowerCaseValueSize() - Method in class it.univr.di.cstnu.graph.CSTNPSUEdgePluggable
- lowerCaseValueSize() - Method in class it.univr.di.cstnu.graph.CSTNUEdgePluggable
- lowerContingentEdge - Variable in class it.univr.di.cstnu.algorithms.CSTNU
-
Utility map that returns the edge containing the lower-case constraint of a contingent link given the contingent time point.
- lowerContingentEdge - Variable in class it.univr.di.cstnu.algorithms.OSTNU
-
Utility map that returns the edge containing the lower-case constraint of a contingent link given the contingent timepoint.
- lowerContingentLink - Variable in class it.univr.di.cstnu.algorithms.CSTNPSU
-
Utility map that returns the edge containing the lower-case constraint of a contingent link given the contingent time point.
- lpMustRestricted2ConsistentLabel(int, int) - Method in class it.univr.di.cstnu.algorithms.CSTN
-
Returns true if label propagation rule (for example,
CSTN.labelPropagation(it.univr.di.cstnu.graph.LabeledNode, it.univr.di.cstnu.graph.LabeledNode, it.univr.di.cstnu.graph.LabeledNode, it.univr.di.cstnu.graph.CSTNEdge, it.univr.di.cstnu.graph.CSTNEdge, it.univr.di.cstnu.graph.CSTNEdge)
method) has to apply only for consistent labels. - lpMustRestricted2ConsistentLabel(int, int) - Method in class it.univr.di.cstnu.algorithms.CSTNEpsilon
- lpMustRestricted2ConsistentLabel(int, int) - Method in class it.univr.di.cstnu.algorithms.CSTNIR
- Luke2GraphML - Class in it.univr.di.cstnu.util
-
Utility class for converting a (C)STN(U) file in Luke format to GraphML format.
- Luke2GraphML() - Constructor for class it.univr.di.cstnu.util.Luke2GraphML
M
- main(String[]) - Static method in class it.univr.di.cstnu.algorithms.CSTN
-
Just for using this class, also from a terminal.
- main(String[]) - Static method in class it.univr.di.cstnu.algorithms.CSTN2CSTN0
- main(String[]) - Static method in class it.univr.di.cstnu.algorithms.CSTNEpsilon
-
Just for using this class, also from a terminal.
- main(String[]) - Static method in class it.univr.di.cstnu.algorithms.CSTNEpsilon3R
-
Just for using this class, also from a terminal.
- main(String[]) - Static method in class it.univr.di.cstnu.algorithms.CSTNEpsilon3RwoNodeLabels
-
Just for using this class, also from a terminal.
- main(String[]) - Static method in class it.univr.di.cstnu.algorithms.CSTNEpsilonwoNodeLabels
-
Just for using this class, also from a terminal.
- main(String[]) - Static method in class it.univr.di.cstnu.algorithms.CSTNIR
-
Just for using this class, also from a terminal.
- main(String[]) - Static method in class it.univr.di.cstnu.algorithms.CSTNIR3R
-
Just for using this class also from a terminal.
- main(String[]) - Static method in class it.univr.di.cstnu.algorithms.CSTNIR3RwoNodeLabels
-
Just for using this class, also from a terminal.
- main(String[]) - Static method in class it.univr.di.cstnu.algorithms.CSTNIRwoNodeLabels
-
Just for using this class, also from a terminal.
- main(String[]) - Static method in class it.univr.di.cstnu.algorithms.CSTNPotential
-
Just for using this class also from a terminal.
- main(String[]) - Static method in class it.univr.di.cstnu.algorithms.CSTNPSU
-
Reads a CSTNPSU file and determines its prototypal link.
- main(String[]) - Static method in class it.univr.di.cstnu.algorithms.CSTNU
-
Reads a CSTNU file and checks it.
- main(String[]) - Static method in class it.univr.di.cstnu.algorithms.CSTNU2CSTN
- main(String[]) - Static method in class it.univr.di.cstnu.algorithms.CSTNwoNodeLabel
-
Just for using this class also from a terminal.
- main(String[]) - Static method in class it.univr.di.cstnu.algorithms.FTNU
- main(String[]) - Static method in class it.univr.di.cstnu.algorithms.OSTNU
-
Reads a CSTNU file and checks it.
- main(String[]) - Static method in class it.univr.di.cstnu.algorithms.PCSTNU
-
Reads a PCSTNU file and checks it.
- main(String[]) - Static method in class it.univr.di.cstnu.algorithms.STN
- main(String[]) - Static method in class it.univr.di.cstnu.algorithms.STNU
- main(String[]) - Static method in class it.univr.di.cstnu.algorithms.STNURTE
- main(String[]) - Static method in class it.univr.di.cstnu.util.Checker
-
Allows checking the execution time of a DC checking algorithm, given a set of instances.
- main(String[]) - Static method in class it.univr.di.cstnu.util.CSTNRandomGenerator
- main(String[]) - Static method in class it.univr.di.cstnu.util.CSTNU2CSTNPSU
-
Allows the modification of a set of input instances.
- main(String[]) - Static method in class it.univr.di.cstnu.util.CSTNU2UppaalTiga
-
Reads a CSTNU file and converts it into UPPAAL TIGA format.
- main(String[]) - Static method in class it.univr.di.cstnu.util.DispatchabilityBenchmarkRunner
-
Allows checking the execution time of algorithms on a set of instances.
- main(String[]) - Static method in class it.univr.di.cstnu.util.GraphML2Luke
- main(String[]) - Static method in class it.univr.di.cstnu.util.Luke2GraphML
- main(String[]) - Static method in class it.univr.di.cstnu.util.OSTNURandomGenerator
- main(String[]) - Static method in class it.univr.di.cstnu.util.PSTNRTEBenchmarkRunner
-
Allows checking the execution time of algorithms on a set of instances.
- main(String[]) - Static method in class it.univr.di.cstnu.util.SRNCFinderBenchmarkRunner
-
Allows checking the execution time of algorithms on a set of instances.
- main(String[]) - Static method in class it.univr.di.cstnu.util.STNUDensifier
-
Allows the modification of a set of input instances.
- main(String[]) - Static method in class it.univr.di.cstnu.util.STNURandomGenerator
- main(String[]) - Static method in class it.univr.di.cstnu.util.STNURTEBenchmarkRunner
-
Allows checking the execution time of algorithms for a set of instances.
- main(String[]) - Static method in class it.univr.di.cstnu.visualization.TNEditor
- main(String[]) - Static method in class it.univr.di.labeledvalue.LabeledIntHierarchyMap
- mainConditionForRestrictedLP(int, int) - Static method in class it.univr.di.cstnu.algorithms.CSTNU
-
IR Semantics
- mainConditionForSkippingInR0qR0(int) - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN
-
Returns true if
AbstractCSTN.labelModificationR0qR0(it.univr.di.cstnu.graph.LabeledNode, it.univr.di.cstnu.graph.LabeledNode, E)
method has to not apply. - mainConditionForSkippingInR0qR0(int) - Method in class it.univr.di.cstnu.algorithms.CSTNEpsilon
- mainConditionForSkippingInR0qR0(int) - Method in class it.univr.di.cstnu.algorithms.CSTNIR
- mainConditionForSkippingInR0qR0(int) - Method in class it.univr.di.cstnu.algorithms.CSTNU
-
IR Semantics Returns true if
AbstractCSTN.labelModificationR0qR0(it.univr.di.cstnu.graph.LabeledNode, it.univr.di.cstnu.graph.LabeledNode, E)
method has to not apply. - mainConditionForSkippingInR3qR3(int, LabeledNode) - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN
-
Returns true if
CSTN.labelModificationR3qR3(it.univr.di.cstnu.graph.LabeledNode, it.univr.di.cstnu.graph.LabeledNode, it.univr.di.cstnu.graph.CSTNEdge)
method has to not apply. - mainConditionForSkippingInR3qR3(int, LabeledNode) - Method in class it.univr.di.cstnu.algorithms.CSTNEpsilon
- mainInt2SetMap - Variable in class it.univr.di.labeledvalue.LabeledIntTreeMap
-
Design choice: the set of labeled values of this map is organized as a collection of sets, each containing labels of the same length.
- mainMap - Variable in class it.univr.di.labeledvalue.LabeledIntSimpleMap
-
Deprecated.Map of label
- MAKE_MINIMAL_DISPATCHABLE(TNGraph<E>) - Static method in class it.univr.di.cstnu.algorithms.STN
-
Adds to the given graph the undominated edges and returns such added/modified edges as a map
((sourceName, destinationName), edge)
. - MAKE_NODES_REACHABLE_BY(TNGraph<E>, LabeledNode, int, String) - Static method in class it.univr.di.cstnu.algorithms.STN
-
Makes each node reachable by the source, adding an edge between the source and each other node with value
horizon
and name prefixed byprefix
, followed by "__", source name, "__", and node name. - makeAllMaxProjection() - Method in class it.univr.di.cstnu.algorithms.OSTNU
- makeAlphaBetaGammaPrime4R3(LabeledNode, LabeledNode, LabeledNode, char, Label, Label) - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN
-
A simple method to determine the label "αβγ" for the rule
CSTN.labelModificationR3qR3(LabeledNode, LabeledNode, CSTNEdge)
. - makeAlphaPrime(LabeledNode, LabeledNode, char, Label) - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN
-
Simple method to determine the
α'
to use in rules R0 and in rule qR0. - makeBetaGammaDagger4qR3(LabeledNode, LabeledNode, char, Label, Label) - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN
-
Simple method to determine the label (β*γ)† to use in rules qR3*
CSTN.labelModificationR3qR3(LabeledNode, LabeledNode, CSTNEdge)
. - makeDispatchable() - Method in class it.univr.di.cstnu.algorithms.STN
-
Makes the graph dispatchable by applying the Muscettola et al. 1998 algorithm, considering Z as the source node.
- makeMinimalDispatchable() - Method in class it.univr.di.cstnu.algorithms.STN
-
This makes this network dispatchable, where edges are only the undominated ones.
- makeNewEdge(String, Edge.ConstraintType) - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN
-
Create an edge, ensuring that its name is unique in the graph 'g'.
- makeNewEdge(String, Edge.ConstraintType) - Method in class it.univr.di.cstnu.graph.TNGraph
-
Creates a new edge proper for this graph using edgeName as a proposed name (it will be modified by adding a suffix if there is already another edge with name edgeName) and setting the type to type.
- makeOrdinaryConstraintMinimalDispatchable(ObjectSet<E>, ObjectSet<E>) - Method in class it.univr.di.cstnu.algorithms.STNU
-
Adds to the given graph the undominated edges and returns such added/modified edges as a map
((sourceName, destinationName), edge)
. - manageParameters(String[]) - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN
-
Simple method to manage command line parameters using the "args4j" library.
- manageParameters(String[]) - Method in class it.univr.di.cstnu.algorithms.STN
-
Simple method to manage command line parameters using the `args4j` library.
- manageParameters(String[]) - Method in class it.univr.di.cstnu.algorithms.STNU
-
Simple method to manage command line parameters using the args4j library.
- manageParameters(String[]) - Method in class it.univr.di.cstnu.visualization.TNEditor
-
Simple method to manage command line parameters using the args4j library.
- map - Variable in class it.univr.di.labeledvalue.LabeledALabelIntTreeMap
-
Data structure.
- mapInfoLabel - Variable in class it.univr.di.cstnu.visualization.TNEditor
- MAX_ALABELALPHABET_SIZE - Static variable in class it.univr.di.labeledvalue.ALabel
-
Maximum size for the alphabet.
- MAX_ALABELALPHABET_SIZE - Static variable in class it.univr.di.labeledvalue.ALabelAlphabet
-
Maximum size for the alphabet.
- MAX_CHECKS - Static variable in class it.univr.di.cstnu.util.CSTNRandomGenerator
-
Maximum checks for a network
- MAX_CHECKS - Static variable in class it.univr.di.cstnu.util.OSTNURandomGenerator
-
Maximum checks for a network
- MAX_CHECKS - Static variable in class it.univr.di.cstnu.util.STNUDensifier
-
Maximum checks for a network
- MAX_CHECKS - Static variable in class it.univr.di.cstnu.util.STNURandomGenerator
-
Maximum checks for a network
- MAX_CONTINGENT_RANGE - Static variable in class it.univr.di.cstnu.util.OSTNURandomGenerator
-
Max distance between lower and upper value in a contingent link
- MAX_CONTINGENT_RANGE - Static variable in class it.univr.di.cstnu.util.STNURandomGenerator
-
Max distance between lower and upper value in a contingent link
- MAX_CONTINGENT_WEIGHT - Static variable in class it.univr.di.cstnu.util.OSTNURandomGenerator
-
Max weight value
- MAX_CONTINGENT_WEIGHT - Static variable in class it.univr.di.cstnu.util.STNURandomGenerator
-
Max weight value
- maxEdgeRepetition() - Method in record class it.univr.di.cstnu.algorithms.STNU.STNUCheckStatus.SRNCInfo
-
Returns the value of the
maxEdgeRepetition
record component. - maxMeterSize - Static variable in class it.univr.di.cstnu.util.RunMeter
-
A value between 0 and 100
- maxMinConstraint - Variable in class it.univr.di.cstnu.algorithms.STNU.STNUCheckStatus
-
maxMin constraint added;
- maxOutlierSpan() - Method in record class it.univr.di.cstnu.util.PSTNRTEBenchmarkRunner.PSTNSituation
-
Returns the value of the
maxOutlierSpan
record component. - maxWeight - Variable in class it.univr.di.cstnu.algorithms.AbstractCSTN
-
The absolute value of the max negative weight was determined during the initialization phase.
- mergeLabeledValue(Label, int) - Method in class it.univr.di.cstnu.graph.BasicCSTNUEdgePluggable
- mergeLabeledValue(Label, int) - Method in interface it.univr.di.cstnu.graph.CSTNEdge
-
Merges the labeled value i into the set of labeled values of this edge.
- mergeLabeledValue(Label, int) - Method in class it.univr.di.cstnu.graph.CSTNEdgePluggable
-
Merges the labeled value i into the set of labeled values of this edge.
- mergeLabeledValue(Label, int) - Method in class it.univr.di.cstnu.graph.CSTNPSUEdgePluggable
- mergeLabeledValue(String, int) - Method in interface it.univr.di.cstnu.graph.CSTNEdge
-
Wrapper method for
CSTNEdge.mergeLabeledValue(Label, int)
. - mergeLabeledValue(String, int) - Method in class it.univr.di.cstnu.graph.CSTNEdgePluggable
-
Wrapper method for
CSTNEdge.mergeLabeledValue(Label, int)
. - mergeLabeledValues(LabeledIntMap) - Method in interface it.univr.di.cstnu.graph.CSTNEdge
- mergeLabeledValues(LabeledIntMap) - Method in class it.univr.di.cstnu.graph.CSTNEdgePluggable
- mergeLowerCaseValue(Label, ALabel, int) - Method in interface it.univr.di.cstnu.graph.CSTNPSUEdge
-
Merge a lower label constraint with value
i
for the node namen
with labell
. - mergeLowerCaseValue(Label, ALabel, int) - Method in class it.univr.di.cstnu.graph.CSTNPSUEdgePluggable
- mergeTriple(Label, ALabel, int) - Method in class it.univr.di.labeledvalue.LabeledALabelIntTreeMap.LabeledALabelIntTreeMapView
-
Object Read-only.
- mergeTriple(Label, ALabel, int) - Method in class it.univr.di.labeledvalue.LabeledALabelIntTreeMap
- mergeTriple(Label, ALabel, int, boolean) - Method in class it.univr.di.labeledvalue.LabeledALabelIntTreeMap.LabeledALabelIntTreeMapView
-
Object Read-only.
- mergeTriple(Label, ALabel, int, boolean) - Method in class it.univr.di.labeledvalue.LabeledALabelIntTreeMap
-
Merges a label case value
(p,l,i)
. - mergeTriple(String, ALabel, int) - Method in class it.univr.di.labeledvalue.LabeledALabelIntTreeMap.LabeledALabelIntTreeMapView
-
Object Read-only.
- mergeTriple(String, ALabel, int) - Method in class it.univr.di.labeledvalue.LabeledALabelIntTreeMap
-
Wrapper method.
- mergeTriple(String, ALabel, int, boolean) - Method in class it.univr.di.labeledvalue.LabeledALabelIntTreeMap.LabeledALabelIntTreeMapView
-
Object Read-only.
- mergeTriple(String, ALabel, int, boolean) - Method in class it.univr.di.labeledvalue.LabeledALabelIntTreeMap
-
Wrapper method of
LabeledALabelIntTreeMap.mergeTriple(Label, ALabel, int, boolean)
. - mergeUpperCaseValue(Label, ALabel, int) - Method in interface it.univr.di.cstnu.graph.BasicCSTNUEdge
-
Merge an upper label constraint with delay
i
for the node name n with propositional labell
. - mergeUpperCaseValue(Label, ALabel, int) - Method in class it.univr.di.cstnu.graph.BasicCSTNUEdgePluggable
- MIDDLE_EXECUTION_STRATEGY - Enum constant in enum class it.univr.di.cstnu.algorithms.STNURTE.StrategyEnum
-
Returns the middle possible execution time,
m
, with all nodes that can be executed at that time, i.e.,l' ≤ m
.
It is assumed thatcandidates.timeInterval = [l, u], m = (l+u)/2
and each node has a time interval[l',u']
such thatl ≤ l'
andu ≤ u'
. - MIN_MAX_WEIGHT - Static variable in class it.univr.di.cstnu.util.CSTNRandomGenerator
-
Min max weight value
- MIN_MAX_WEIGHT - Static variable in class it.univr.di.cstnu.util.OSTNURandomGenerator
-
Min max weight value
- MIN_MAX_WEIGHT - Static variable in class it.univr.di.cstnu.util.STNURandomGenerator
-
Min max weight value
- MIN_NODES - Static variable in class it.univr.di.cstnu.util.CSTNRandomGenerator
-
Minimum number of nodes
- MIN_NODES - Static variable in class it.univr.di.cstnu.util.OSTNURandomGenerator
-
Min number of nodes
- MIN_NODES - Static variable in class it.univr.di.cstnu.util.STNURandomGenerator
-
Minimum number of nodes
- MIN_NODES_QLOOP - Static variable in class it.univr.di.cstnu.util.CSTNRandomGenerator
-
Minimum number of nodes in a qLoop
- MIN_PROPOSITIONS - Static variable in class it.univr.di.cstnu.util.CSTNRandomGenerator
-
Minimum number of propositions
- minDEaddDiamondStandInEdges(ObjectSet<STNUEdge>, GraphDistances, Collection<LabeledNode>) - Method in class it.univr.di.cstnu.algorithms.STNU
-
Checks all possible diamonds for each contingent link, adding possible stand-in edges implied by the diamond structure.
- minDEbetterGetStandInEdgesAssumingManyDiamonds(Instant) - Method in class it.univr.di.cstnu.algorithms.STNU
-
It makes sanity check fixing each wait
(V, C:-v, A)
if v≤x or v>y. - minDEgetIndividualStandInEdges() - Method in class it.univr.di.cstnu.algorithms.STNU
-
Helper function for the minimization algorithms of dispatchable STNUs.
- minDEgetNegOrdWaitInfo(Object2IntMap<LabeledNode>, ObjectSet<STNUEdge>) - Method in class it.univr.di.cstnu.algorithms.STNU
-
Finds negOrdWait paths between pairs of activation timepoints.
- minDEgetStandInEdges(Instant) - Method in class it.univr.di.cstnu.algorithms.STNU
-
It makes sanity check fixing each wait
(V, C:-v, A)
if v≤x or v>y. - minDEgetWaitsMarkedToRemove(ObjectSet<STNUEdge>, GraphDistances) - Method in class it.univr.di.cstnu.algorithms.STNU
-
Helper function for the minimization algorithms of dispatchable STNUs.
- minDEremoveStandInEdges(ObjectSet<STNUEdge>) - Method in class it.univr.di.cstnu.algorithms.STNU
-
Remove ordinary weak constraints from the network that were added by
STNU.minDEgetStandInEdges(Instant)
. - minNegativeWeight - Variable in class it.univr.di.cstnu.algorithms.STN
-
The absolute value of the max negative weight was determined during the initialization phase.
- modCount - Variable in class it.univr.di.labeledvalue.ALabel
-
The number of times this ALabel has been structurally modified.
- modeBoxIndex - Variable in class it.univr.di.cstnu.visualization.TNEditor
-
Position of the mode box for the main editor
- modeBoxViewerIndex - Variable in class it.univr.di.cstnu.visualization.TNEditor
-
Position of the mode box for the viewer
- ModeKeyAdapter(char, char, char, char, ModalGraphMouse) - Constructor for class it.univr.di.cstnu.visualization.EditingModalGraphMouse.ModeKeyAdapter
- ModeKeyAdapter(ModalGraphMouse) - Constructor for class it.univr.di.cstnu.visualization.EditingModalGraphMouse.ModeKeyAdapter
- modelType() - Method in class it.univr.di.cstnu.visualization.ObservableValidator
- Morris2014 - Enum constant in enum class it.univr.di.cstnu.algorithms.STNU.CheckAlgorithm
-
Morris cubic algorithm
- MORRIS2014_UPDATE_DISTANCE(LabeledNode, int, int, ExtendedPriorityQueue<LabeledNode>, Object2IntOpenHashMap<LabeledNode>) - Static method in class it.univr.di.cstnu.algorithms.STNU
-
Updates the distance values between the node (V) preceding the source (U) of a negative edge and the destination node (X) of the negative edge.
- morris2014DCBackpropagation(LabeledNode, Object2ObjectMap<LabeledNode, STNU.ElementStatus>) - Method in class it.univr.di.cstnu.algorithms.STNU
-
Recursive procedure for
STNU.applyMorris2014()
method. - Morris2014Dispatchable - Enum constant in enum class it.univr.di.cstnu.algorithms.STNU.CheckAlgorithm
-
Morris cubic algorithm
- morris2014DispatchableDCBackpropagation(LabeledNode, boolean, Object2ObjectMap<LabeledNode, STNUEdge>, Object2ObjectMap<LabeledNode, STNU.ElementStatus>) - Method in class it.univr.di.cstnu.algorithms.STNU
-
Recursive procedure for
STNU.applyMorris2014Dispatchable()
method. - morrisSuffix - Static variable in class it.univr.di.cstnu.util.STNURTEBenchmarkRunner
-
The filename suffix of STNU was checked by the MorrisDispatchable algorithm.
- mouseClicked(MouseEvent) - Method in class it.univr.di.cstnu.visualization.CSTNUGraphAttributeEditingMousePlugin
-
For primary modifiers (default, MouseButton1): Pick a single Vertex or Edge under the mouse pointer.
If no Vertex or Edge is under the pointer, unselect all picked Vertices and Edges, and set up to draw a rectangle for multiple selection of contained Vertices. - mouseClicked(MouseEvent) - Method in class it.univr.di.cstnu.visualization.EditingGraphMousePlugin
- mouseDragged(MouseEvent) - Method in class it.univr.di.cstnu.visualization.EditingGraphMousePlugin
-
If startVertex is non-null, stretch an edge shape between startVertex and the mouse pointer to simulate edge creation
- mouseEntered(MouseEvent) - Method in class it.univr.di.cstnu.visualization.EditingGraphMousePlugin
- mouseEventToolTipFunction - Static variable in class it.univr.di.cstnu.visualization.TNEditor
-
Tooltip rendering for the mouse movement
- mouseExited(MouseEvent) - Method in class it.univr.di.cstnu.visualization.EditingGraphMousePlugin
- mouseMoved(MouseEvent) - Method in class it.univr.di.cstnu.visualization.EditingGraphMousePlugin
- mousePressed(MouseEvent) - Method in class it.univr.di.cstnu.visualization.EditingGraphMousePlugin
- mouseReleased(MouseEvent) - Method in class it.univr.di.cstnu.visualization.EditingGraphMousePlugin
N
- name - Variable in class it.univr.di.cstnu.graph.AbstractComponent
-
Possible name
- name - Variable in class it.univr.di.labeledvalue.ALabelAlphabet.ALetter
- nameCorrespondingEndNode(String) - Static method in class it.univr.di.cstnu.visualization.CSTNLayout
- nameCorrespondingStartNode(String) - Static method in class it.univr.di.cstnu.visualization.CSTNLayout
- nameCorrespondingXOREndNode(String) - Static method in class it.univr.di.cstnu.visualization.CSTNLayout
- NEGATED - Static variable in class it.univr.di.labeledvalue.Literal
-
Constant
NEGATED=Constants.NOT
- negation() - Method in class it.univr.di.labeledvalue.Label
-
Since a label is a conjunction of literals, its negation is a disjunction of negative literals (i.e., not a label).
- NEGATIVE_INFINITY_SYMBOLstring - Static variable in class it.univr.di.labeledvalue.Constants
-
Negative infinitive.
- negativeCycle - Variable in class it.univr.di.cstnu.algorithms.STN.STNCheckStatus
-
The list of LabeledNode representing a negative loop has been found (if the network is not consistent, the algorithm can build it).
- negativeLoopNode - Variable in class it.univr.di.cstnu.algorithms.STN.STNCheckStatus
-
The node with a negative loop when the graph is not consistent, and the algorithm can determine only the node with a negative loop.
- negativeSTNUCycle - Variable in class it.univr.di.cstnu.algorithms.STNU.STNUCheckStatus
-
Negative STNU cycle.
- negLen() - Method in record class it.univr.di.cstnu.algorithms.STNU.DistancePair
-
Returns the value of the
negLen
record component. - negWait() - Method in record class it.univr.di.cstnu.algorithms.STNU.DistancePair
-
Returns the value of the
negWait
record component. - NETWORK_TYPE_KEY - Static variable in class it.univr.di.cstnu.graph.TNGraphMLWriter
- networkType - Variable in class it.univr.di.cstnu.graph.TNGraphMLWriter
-
Graph type
- neverPresent - Enum constant in enum class it.univr.di.cstnu.util.ExtendedPriorityQueue.Status
-
The element has never been added to the queue.
- newInstance() - Method in class it.univr.di.cstnu.graph.CSTNEdgePluggable
- newInstance() - Method in class it.univr.di.cstnu.graph.CSTNPSUEdgePluggable
- newInstance() - Method in class it.univr.di.cstnu.graph.CSTNUEdgePluggable
- newInstance() - Method in interface it.univr.di.cstnu.graph.Edge
-
Factory
- newInstance() - Method in class it.univr.di.cstnu.graph.LabeledNode
- newInstance() - Method in interface it.univr.di.cstnu.graph.Node
-
Factory
- newInstance() - Method in class it.univr.di.cstnu.graph.OSTNUEdgePluggable
- newInstance() - Method in class it.univr.di.cstnu.graph.STNEdgeInt
- newInstance() - Method in class it.univr.di.cstnu.graph.STNUEdgeInt
- newInstance() - Method in class it.univr.di.labeledvalue.LabeledIntHierarchyMap
- newInstance() - Method in interface it.univr.di.labeledvalue.LabeledIntMap
-
Factory
- newInstance() - Method in class it.univr.di.labeledvalue.LabeledIntSimpleMap
-
Deprecated.
- newInstance() - Method in class it.univr.di.labeledvalue.LabeledIntTreeMap
- newInstance() - Method in class it.univr.di.labeledvalue.LabeledIntTreeSimpleMap
- newInstance(boolean) - Method in class it.univr.di.labeledvalue.LabeledIntHierarchyMap
-
Factory
- newInstance(boolean) - Method in interface it.univr.di.labeledvalue.LabeledIntMap
-
Factory
- newInstance(boolean) - Method in class it.univr.di.labeledvalue.LabeledIntSimpleMap
-
Deprecated.Factory
- newInstance(boolean) - Method in class it.univr.di.labeledvalue.LabeledIntTreeMap
- newInstance(boolean) - Method in class it.univr.di.labeledvalue.LabeledIntTreeSimpleMap
- newInstance(Edge) - Method in class it.univr.di.cstnu.graph.CSTNEdgePluggable
- newInstance(Edge) - Method in class it.univr.di.cstnu.graph.CSTNPSUEdgePluggable
- newInstance(Edge) - Method in class it.univr.di.cstnu.graph.CSTNUEdgePluggable
- newInstance(Edge) - Method in interface it.univr.di.cstnu.graph.Edge
-
Any super-interfaces/implementing classes should ensure that such a method has the edge as an argument!
- newInstance(Edge) - Method in class it.univr.di.cstnu.graph.OSTNUEdgePluggable
- newInstance(Edge) - Method in class it.univr.di.cstnu.graph.STNEdgeInt
- newInstance(Edge) - Method in class it.univr.di.cstnu.graph.STNUEdgeInt
- newInstance(Node) - Method in class it.univr.di.cstnu.graph.LabeledNode
- newInstance(Node) - Method in interface it.univr.di.cstnu.graph.Node
-
Any super-interfaces/implementing classes should ensure that such a method has an Edge node as an argument!
- newInstance(LabeledIntMap) - Method in class it.univr.di.labeledvalue.LabeledIntHierarchyMap
- newInstance(LabeledIntMap) - Method in interface it.univr.di.labeledvalue.LabeledIntMap
-
Factory
- newInstance(LabeledIntMap) - Method in class it.univr.di.labeledvalue.LabeledIntSimpleMap
-
Deprecated.
- newInstance(LabeledIntMap) - Method in class it.univr.di.labeledvalue.LabeledIntTreeMap
- newInstance(LabeledIntMap) - Method in class it.univr.di.labeledvalue.LabeledIntTreeSimpleMap
- newInstance(LabeledIntMap, boolean) - Method in class it.univr.di.labeledvalue.LabeledIntHierarchyMap
-
Factory
- newInstance(LabeledIntMap, boolean) - Method in interface it.univr.di.labeledvalue.LabeledIntMap
-
Factory
- newInstance(LabeledIntMap, boolean) - Method in class it.univr.di.labeledvalue.LabeledIntSimpleMap
-
Deprecated.Factory
- newInstance(LabeledIntMap, boolean) - Method in class it.univr.di.labeledvalue.LabeledIntTreeMap
- newInstance(LabeledIntMap, boolean) - Method in class it.univr.di.labeledvalue.LabeledIntTreeSimpleMap
- newInstance(String) - Method in class it.univr.di.cstnu.graph.CSTNEdgePluggable
- newInstance(String) - Method in class it.univr.di.cstnu.graph.CSTNPSUEdgePluggable
- newInstance(String) - Method in class it.univr.di.cstnu.graph.CSTNUEdgePluggable
- newInstance(String) - Method in interface it.univr.di.cstnu.graph.Edge
-
Factory
- newInstance(String) - Method in class it.univr.di.cstnu.graph.LabeledNode
- newInstance(String) - Method in interface it.univr.di.cstnu.graph.Node
-
Factory
- newInstance(String) - Method in class it.univr.di.cstnu.graph.OSTNUEdgePluggable
- newInstance(String) - Method in class it.univr.di.cstnu.graph.STNEdgeInt
- newInstance(String) - Method in class it.univr.di.cstnu.graph.STNUEdgeInt
- newValueInR3qR3(int, int) - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN
-
Determines the new value that rules R3 and qR3 (see Table 1 in the ICAPS 2016 paper) must add.
- newValueInR3qR3(int, int) - Method in class it.univr.di.cstnu.algorithms.CSTNEpsilon
-
According to Table 2 paper ICAPS16, it returns
max(edgeValue, obsEdgeValue-ɛ)
. - node - Variable in class it.univr.di.cstnu.visualization.ObservableValidator
- node() - Method in record class it.univr.di.cstnu.algorithms.STNURTE.NodeWithTimeInterval
-
Returns the value of the
node
record component. - Node - Interface in it.univr.di.cstnu.graph
-
Root class for representing nodes in it.univr.di.cstnu package.
- NODE_LABEL_KEY - Static variable in class it.univr.di.cstnu.graph.TNGraphMLWriter
- NODE_LOGNORMALDISTRIBUTION_KEY - Static variable in class it.univr.di.cstnu.graph.TNGraphMLWriter
- NODE_NAME_PREFIX - Static variable in class it.univr.di.cstnu.util.OSTNURandomGenerator
-
Default node name prefix
- NODE_NAME_PREFIX - Static variable in class it.univr.di.cstnu.util.STNURandomGenerator
-
Default node name prefix
- NODE_OBSERVED_KEY - Static variable in class it.univr.di.cstnu.graph.TNGraphMLWriter
- NODE_PARAMETER_KEY - Static variable in class it.univr.di.cstnu.graph.TNGraphMLWriter
- NODE_POTENTIAL_KEY - Static variable in class it.univr.di.cstnu.graph.TNGraphMLWriter
- NODE_X_KEY - Static variable in class it.univr.di.cstnu.graph.TNGraphMLWriter
- NODE_Y_KEY - Static variable in class it.univr.di.cstnu.graph.TNGraphMLWriter
- nodeDrawPaintTransformer(PickedInfo<K>, Paint, Paint, Paint, Paint, Paint, Paint) - Static method in enum class it.univr.di.cstnu.visualization.NodeRendering
-
Returns a transformer to select the color that is used to draw the node.
- NodeEnabledInTimeInterval(TimeInterval, ObjectSet<STNURTE.NodeWithTimeInterval>) - Constructor for record class it.univr.di.cstnu.algorithms.STNURTE.NodeEnabledInTimeInterval
-
Creates an instance of a
NodeEnabledInTimeInterval
record class. - NodeOccurrence(int, Set<LabeledNode>) - Constructor for record class it.univr.di.cstnu.algorithms.STNURTE.NodeOccurrence
-
Creates an instance of a
NodeOccurrence
record class. - nodePotential - Variable in class it.univr.di.cstnu.algorithms.STNU.RULGlobalInfo
-
Potential of each node.
- NodeRendering - Enum Class in it.univr.di.cstnu.visualization
-
Provides a method for LabeledNode rendering in the TNEditor GUI application.
- nodes - Variable in class it.univr.di.cstnu.util.Checker.GlobalStatisticKey
-
# of nodes
- nodes() - Method in record class it.univr.di.cstnu.algorithms.STNURTE.NodeEnabledInTimeInterval
-
Returns the value of the
nodes
record component. - nodes() - Method in record class it.univr.di.cstnu.algorithms.STNURTE.NodeOccurrence
-
Returns the value of the
nodes
record component. - nodes2check - Variable in class it.univr.di.cstnu.algorithms.AbstractCSTN.NodesToCheck
-
It must be a queue without a replication set because a node may be added more than once!
- NodesToCheck() - Constructor for class it.univr.di.cstnu.algorithms.AbstractCSTN.NodesToCheck
- NodesToCheck(Collection<LabeledNode>) - Constructor for class it.univr.di.cstnu.algorithms.AbstractCSTN.NodesToCheck
-
A simple constructor when the initial set of nodes is available.
- nodesToExecute - Variable in class it.univr.di.cstnu.algorithms.STNURTE.RTED
-
The ordinary nodes to execute at
STNURTE.RTED.executionTime
- NodeWithTimeInterval(TimeInterval, LabeledNode) - Constructor for record class it.univr.di.cstnu.algorithms.STNURTE.NodeWithTimeInterval
-
Creates an instance of a
NodeWithTimeInterval
record class. - nonLinearOptimization(double[], double[][], double[], double[], double[]) - Method in interface it.univr.di.cstnu.util.OptimizationEngine
-
Finds a minimum value of the non-linear problem specified as
- NonNegIntValueRE - Static variable in class it.univr.di.labeledvalue.Constants
-
Regular expression for an acceptable positive integer.
- NOT - Static variable in class it.univr.di.cstnu.util.CSTNU2UppaalTiga
-
Token to represent logic NOT in Tiga expression.
- NOT - Static variable in class it.univr.di.labeledvalue.Constants
-
Char representing the logic 'not' symbol: ¬.
- NOT_DC_SUB_DIR_NAME - Static variable in class it.univr.di.cstnu.util.CSTNRandomGenerator
-
Name of subdirectory containing NOT DC instances
- NOT_DC_SUB_DIR_NAME - Static variable in class it.univr.di.cstnu.util.OSTNURandomGenerator
-
Name of sub dir containing NOT DC instances
- NOT_DC_SUB_DIR_NAME - Static variable in class it.univr.di.cstnu.util.STNURandomGenerator
-
Name of subdirectory containing NOT DC instances
- note - Variable in class it.univr.di.cstnu.algorithms.STN.STNCheckStatus
-
A possible note
- notOkOutBounds - Enum constant in enum class it.univr.di.cstnu.util.PSTNRTEBenchmarkRunner.ExitExecution
-
not successful with some contingent durations outside the contingent bounds
- NOTstring - Static variable in class it.univr.di.labeledvalue.Constants
- NUMBER_OF_POSSIBLE_PROPOSITIONS - Static variable in class it.univr.di.labeledvalue.Label
-
Maximal number of possible propositions in a network.
- numberOfNodes - Variable in class it.univr.di.cstnu.algorithms.CSTNPotential
-
TNGraph<CSTNEdge> order
O
- ObjectArrayFIFOSetQueue<K> - Class in it.univr.di.cstnu.util
-
A type-specific array-based FIFO queue, supporting also dequeue operations.
- ObjectArrayFIFOSetQueue() - Constructor for class it.univr.di.cstnu.util.ObjectArrayFIFOSetQueue
-
Creates a new empty queue with standard ObjectArrayFIFOSetQueue.INITIAL_CAPACITY.
- ObjectArrayFIFOSetQueue(int) - Constructor for class it.univr.di.cstnu.util.ObjectArrayFIFOSetQueue
-
Creates a new empty queue with the given capacity.
- ObjectPair<T> - Class in it.univr.di.cstnu.util
-
An implementation of
Collection
interface that stores exactly two objects and is immutable. - ObjectPair(T, T) - Constructor for class it.univr.di.cstnu.util.ObjectPair
-
Creates a
Pair
from the specified elements. - ObservableValidator - Class in it.univr.di.cstnu.visualization
-
Validator for observable.
- ObservableValidator(TNGraph<?>, LabeledNode) - Constructor for class it.univr.di.cstnu.visualization.ObservableValidator
- ObservationNodeDoesNotExist - Enum constant in enum class it.univr.di.cstnu.algorithms.WellDefinitionException.Type
- ObservationNodeDoesNotOccurBefore - Enum constant in enum class it.univr.di.cstnu.algorithms.WellDefinitionException.Type
-
Deprecated.
- occurrenceTime() - Method in record class it.univr.di.cstnu.algorithms.STNURTE.NodeOccurrence
-
Returns the value of the
occurrenceTime
record component. - okInBound - Enum constant in enum class it.univr.di.cstnu.util.PSTNRTEBenchmarkRunner.ExitExecution
-
successful with all contingent durations inside the contingent bounds
- okOutBounds - Enum constant in enum class it.univr.di.cstnu.util.PSTNRTEBenchmarkRunner.ExitExecution
-
successful with some contingent durations outside the contingent bounds
- ON - Static variable in enum class it.univr.di.Debug
-
Set to
false
to allow the compiler to identify and eliminate debug code. - oneStepAgileControllability(AbstractCSTN.EdgesToCheck<OSTNUEdgePluggable>, Instant) - Method in class it.univr.di.cstnu.algorithms.OSTNU
-
Executes one step of the agile controllability check.
- oneStepBackGraph - Variable in class it.univr.di.cstnu.visualization.TNEditor
-
Necessary TNGraph structure to represent an auxiliary graph.
- oneStepDynamicConsistencyByEdges(AbstractCSTN.EdgesToCheck<CSTNEdge>, Instant) - Method in class it.univr.di.cstnu.algorithms.CSTN
-
Executes one step of the dynamic consistency check.
- oneStepDynamicConsistencyByEdges(AbstractCSTN.EdgesToCheck<CSTNEdge>, Instant) - Method in class it.univr.di.cstnu.algorithms.CSTNPotential
-
Deprecated.
- oneStepDynamicConsistencyByEdgesLimitedToZ(AbstractCSTN.EdgesToCheck<CSTNEdge>, Instant) - Method in class it.univr.di.cstnu.algorithms.CSTN
-
Executes one step of the dynamic consistency check.
- oneStepDynamicConsistencyByEdgesLimitedToZ(AbstractCSTN.EdgesToCheck<CSTNEdge>, Instant) - Method in class it.univr.di.cstnu.algorithms.CSTNPotential
-
Deprecated.
- oneStepDynamicConsistencyByNode() - Method in class it.univr.di.cstnu.algorithms.CSTN
-
Executes one step of the dynamic consistency check.
- oneStepDynamicConsistencyByNode() - Method in class it.univr.di.cstnu.algorithms.CSTNPotential
-
Deprecated.
- oneStepDynamicControllability(AbstractCSTN.EdgesToCheck<CSTNUEdge>, Instant) - Method in class it.univr.di.cstnu.algorithms.CSTNU
-
Executes one step of the dynamic controllability check.
- oneStepDynamicControllability(AbstractCSTN.EdgesToCheck<CSTNUEdge>, Instant) - Method in class it.univr.di.cstnu.algorithms.PCSTNU
- oneStepDynamicControllabilityLimitedToZ(AbstractCSTN.EdgesToCheck<CSTNPSUEdge>, Instant) - Method in class it.univr.di.cstnu.algorithms.CSTNPSU
-
Executes one step of the dynamic controllability check.
- oneStepDynamicControllabilityLimitedToZ(AbstractCSTN.EdgesToCheck<CSTNUEdge>, Instant) - Method in class it.univr.di.cstnu.algorithms.CSTNU
-
Executes one step of the dynamic controllability check, considering only a pair of edges going to Z, i.e., in the form A-->B-->Z.
- oneStepDynamicControllabilityLimitedToZ(AbstractCSTN.EdgesToCheck<CSTNUEdge>, Instant) - Method in class it.univr.di.cstnu.algorithms.PCSTNU
-
Executes one step of the dynamic controllability check, considering only a pair of edges going to/from Z or parameter nodes.
- onlyToZ - Variable in class it.univr.di.cstnu.visualization.TNEditor
-
OnlyToZ says if the DC checking has to be made propagating constraints only to time-point Z
- onlyToZCB - Variable in class it.univr.di.cstnu.visualization.TNEditor
- OPEN_PAIR - Static variable in class it.univr.di.labeledvalue.Constants
-
String representing labeled-value opening.
- OPEN_TUPLE - Static variable in class it.univr.di.labeledvalue.Constants
-
A tuple opening char
- OptimizationEngine - Interface in it.univr.di.cstnu.util
-
Represent a minimal interface to an optimization engine that can solve non-linear optimization problems.
- OptimizationEngine.OptimizationResult - Record Class in it.univr.di.cstnu.util
-
Records the result of a call to the
OptimizationEngine.nonLinearOptimization(double[], double[][], double[], double[], double[])
method. - OptimizationResult(double[], double, int) - Constructor for record class it.univr.di.cstnu.util.OptimizationEngine.OptimizationResult
-
Creates an instance of a
OptimizationResult
record class. - optimize - Variable in class it.univr.di.labeledvalue.AbstractLabeledIntMap
-
Optimize.
- optimumValue() - Method in record class it.univr.di.cstnu.util.OptimizationEngine.OptimizationResult
-
Returns the value of the
optimumValue
record component. - OR - Static variable in class it.univr.di.cstnu.util.CSTNU2UppaalTiga
-
Token to represent logic OR in Tiga expression.
- oracleNode - Variable in class it.univr.di.cstnu.algorithms.OSTNU
-
Utility map that returns the oracle node O_C associated with a contingent node C.
- oracleRuleCalls - Variable in class it.univr.di.cstnu.algorithms.OSTNU.OSTNUCheckStatus
-
Counts the # of applications of different rules.
- ordinary - Enum constant in enum class it.univr.di.cstnu.algorithms.STNU.STNUCheckStatus.SRNCEdges
-
only ordinary edges
- ordinaryLC - Enum constant in enum class it.univr.di.cstnu.algorithms.STNU.STNUCheckStatus.SRNCEdges
-
ordinary and lowercase edges
- ostnu - Variable in class it.univr.di.cstnu.visualization.TNEditor
-
OSTNU checker
- OSTNU - Class in it.univr.di.cstnu.algorithms
-
Represents a Simple Temporal Network with Uncertainty and Oracles (OSTNU).
- OSTNU - Enum constant in enum class it.univr.di.cstnu.graph.TNGraph.NetworkType
-
STNU with oracles
- OSTNU() - Constructor for class it.univr.di.cstnu.algorithms.OSTNU
-
Default constructor, package use only!
- OSTNU(TNGraph<OSTNUEdgePluggable>) - Constructor for class it.univr.di.cstnu.algorithms.OSTNU
-
Constructor for CSTNU
- OSTNU(TNGraph<OSTNUEdgePluggable>, int) - Constructor for class it.univr.di.cstnu.algorithms.OSTNU
-
Constructor for CSTNU
- OSTNU(String) - Constructor for class it.univr.di.cstnu.algorithms.OSTNU
-
Helper constructor for CSTNU.
- OSTNU_SUFFIX - Static variable in class it.univr.di.cstnu.util.OSTNURandomGenerator
- OSTNU.OSTNUCheckStatus - Class in it.univr.di.cstnu.algorithms
-
A simple class to represent the status of the checking algorithm during an execution.
- OSTNUCheckStatus() - Constructor for class it.univr.di.cstnu.algorithms.OSTNU.OSTNUCheckStatus
- OSTNUEdgePluggable - Class in it.univr.di.cstnu.graph
-
An implementation of OSTNUEdge where the labeled value set is not optimized for maintaining scenarios like ¬c,0, and c,1.
- OSTNUEdgePluggable() - Constructor for class it.univr.di.cstnu.graph.OSTNUEdgePluggable
- OSTNUEdgePluggable(Edge) - Constructor for class it.univr.di.cstnu.graph.OSTNUEdgePluggable
-
Constructor to clone the component.
- OSTNUEdgePluggable(String) - Constructor for class it.univr.di.cstnu.graph.OSTNUEdgePluggable
- OSTNURandomGenerator - Class in it.univr.di.cstnu.util
-
Allows one to build random OSTNU instances specifying: number of wanted DC/NOT DC instances And the following parameters that characterize each generated instance: number nodes number of contingent nodes number of oracles max weight for each edge max weight for each contingent link (upper value) max in-degree for each node max out-degree for each node probability to have an edge between any pair of nodes
- OSTNURandomGenerator(int, int, int, int, double, int, int) - Constructor for class it.univr.di.cstnu.util.OSTNURandomGenerator
- ostnuStatus - Variable in class it.univr.di.cstnu.visualization.TNEditor
-
OSTNU check status
- outDegree(LabeledNode) - Method in class it.univr.di.cstnu.graph.TNGraph
- OUTPUT_HEADER - Static variable in class it.univr.di.cstnu.util.Checker
-
Output file header
- OUTPUT_HEADER - Static variable in class it.univr.di.cstnu.util.DispatchabilityBenchmarkRunner
-
Output file header
- OUTPUT_HEADER - Static variable in class it.univr.di.cstnu.util.PSTNRTEBenchmarkRunner
-
Output file header
- OUTPUT_HEADER - Static variable in class it.univr.di.cstnu.util.SRNCFinderBenchmarkRunner
-
Output file header
- OUTPUT_HEADER - Static variable in class it.univr.di.cstnu.util.STNURTEBenchmarkRunner
-
Output file header
- OUTPUT_HEADER_CSTN - Static variable in class it.univr.di.cstnu.util.Checker
-
CSTN header
- OUTPUT_HEADER_CSTNPSU - Static variable in class it.univr.di.cstnu.util.Checker
-
CSTNPSU header
- OUTPUT_HEADER_CSTNU - Static variable in class it.univr.di.cstnu.util.Checker
-
CSTNU header
- OUTPUT_HEADER_STNU - Static variable in class it.univr.di.cstnu.util.Checker
-
Header
- OUTPUT_ROW_ALG_STATS - Static variable in class it.univr.di.cstnu.util.DispatchabilityBenchmarkRunner
-
OUTPUT_ROW is split in OUTPUT_ROW_GRAPH + OUTPUT_ROW_ALG_STATS + OUTPUT_ROW_ALG_STATS + OUTPUT_ROW_ALG_STATS
- OUTPUT_ROW_ALG_STATS - Static variable in class it.univr.di.cstnu.util.PSTNRTEBenchmarkRunner
-
OUTPUT_ROW is split in OUTPUT_ROW_GRAPH + OUTPUT_ROW_ALG_STATS
- OUTPUT_ROW_ALG_STATS - Static variable in class it.univr.di.cstnu.util.SRNCFinderBenchmarkRunner
-
OUTPUT_ROW is split in OUTPUT_ROW_GRAPH + OUTPUT_ROW_ALG_STATS + OUTPUT_ROW_ALG_STATS + OUTPUT_ROW_SRNC_INFO
- OUTPUT_ROW_ALG_STATS - Static variable in class it.univr.di.cstnu.util.STNURTEBenchmarkRunner
-
OUTPUT_ROW is split in OUTPUT_ROW_GRAPH + OUTPUT_ROW_ALG_STATS + OUTPUT_ROW_ALG_STATS + OUTPUT_ROW_ALG_STATS
- OUTPUT_ROW_GRAPH - Static variable in class it.univr.di.cstnu.util.Checker
- OUTPUT_ROW_GRAPH - Static variable in class it.univr.di.cstnu.util.DispatchabilityBenchmarkRunner
-
OUTPUT_ROW is split in OUTPUT_ROW_GRAPH + OUTPUT_ROW_ALG_STATS + OUTPUT_ROW_ALG_STATS + OUTPUT_ROW_ALG_STATS
- OUTPUT_ROW_GRAPH - Static variable in class it.univr.di.cstnu.util.PSTNRTEBenchmarkRunner
-
OUTPUT_ROW is split in OUTPUT_ROW_GRAPH + OUTPUT_ROW_ALG_STATS
- OUTPUT_ROW_GRAPH - Static variable in class it.univr.di.cstnu.util.SRNCFinderBenchmarkRunner
-
OUTPUT_ROW is split in OUTPUT_ROW_GRAPH + OUTPUT_ROW_ALG_STATS + OUTPUT_ROW_ALG_STATS + OUTPUT_ROW_SRNC_INFO
- OUTPUT_ROW_GRAPH - Static variable in class it.univr.di.cstnu.util.STNURTEBenchmarkRunner
-
OUTPUT_ROW is split in OUTPUT_ROW_GRAPH + OUTPUT_ROW_ALG_STATS + OUTPUT_ROW_ALG_STATS + OUTPUT_ROW_ALG_STATS
- OUTPUT_ROW_SRNC_INFO - Static variable in class it.univr.di.cstnu.util.SRNCFinderBenchmarkRunner
-
OUTPUT_ROW is split in OUTPUT_ROW_GRAPH + OUTPUT_ROW_ALG_STATS + OUTPUT_ROW_ALG_STATS + OUTPUT_ROW_SRNC_INFO
- OUTPUT_ROW_TIME - Static variable in class it.univr.di.cstnu.util.Checker
- OUTPUT_ROW_TIME_CSTN - Static variable in class it.univr.di.cstnu.util.Checker
- OUTPUT_ROW_TIME_STATS_CSTNPSU - Static variable in class it.univr.di.cstnu.util.Checker
-
For CSTNPSU statistics
- OUTPUT_ROW_TIME_STATS_CSTNU - Static variable in class it.univr.di.cstnu.util.Checker
- OUTPUT_ROW_TIME_STNU - Static variable in class it.univr.di.cstnu.util.Checker
P
- pairAsString(Label, int) - Static method in class it.univr.di.cstnu.algorithms.AbstractCSTN
- pairAsString(Label, int) - Static method in class it.univr.di.cstnu.graph.BasicCSTNUEdgePluggable
- parameterNodes - Variable in class it.univr.di.cstnu.algorithms.PCSTNU
-
The set of parameter nodes
- parse(String) - Static method in class it.univr.di.cstnu.util.LogNormalDistributionParameter
- parse(String) - Static method in class it.univr.di.labeledvalue.AbstractLabeledIntMap
- parse(String) - Static method in class it.univr.di.labeledvalue.Label
-
Parse a string representing a label and return an equivalent Label object if no errors are found; otherwise, it is null.
- parse(String) - Static method in class it.univr.di.labeledvalue.Literal
-
Parses the string
s
returning the literal represented. - parse(String, ALabelAlphabet) - Static method in class it.univr.di.labeledvalue.ALabel
-
Parse a string representing an ALabel and return an equivalent ALabel object if no errors are found, or if it is null otherwise.
- parse(String, ALabelAlphabet) - Static method in class it.univr.di.labeledvalue.LabeledLowerCaseValue
-
Parses a string representing a labeled lower-case value and returns an object containing the labeled values represented by the string.
- parse(String, ALabelAlphabet, Class<? extends LabeledIntMap>) - Static method in class it.univr.di.labeledvalue.LabeledALabelIntTreeMap
-
Parse a string representing a LabeledValueTreeMap and return an object containing the labeled values represented by the string.
- parse(String, Class<? extends LabeledIntMap>) - Static method in class it.univr.di.labeledvalue.AbstractLabeledIntMap
-
Parse a string representing a LabeledValueTreeMap and return an object containing the labeled values represented by the string.
- partialExecutionTimeNS - Variable in class it.univr.di.cstnu.algorithms.STN.STNCheckStatus
-
Another counter for storing the execution time of a part of the process.
- path - Variable in class it.univr.di.cstnu.algorithms.STNU.RULLocalInfo
-
path maintains, for each node, the path to reach the considered UC edge.
- path - Variable in class it.univr.di.cstnu.algorithms.STNU.STNUPath
-
Internal representation of the path
- patternLabelCharsRE - Static variable in class it.univr.di.labeledvalue.LabeledALabelIntTreeMap
-
Matcher for RE
- pcs - Variable in class it.univr.di.cstnu.graph.AbstractComponent
-
Since Java 9, Observable has no longer been supported.
- pcstnu - Variable in class it.univr.di.cstnu.visualization.TNEditor
-
PCSTNU checker
- PCSTNU - Class in it.univr.di.cstnu.algorithms
-
Simple class that extends CSTNU for representing and managing 'parameter nodes'.
- PCSTNU - Enum constant in enum class it.univr.di.cstnu.graph.TNGraph.NetworkType
-
Parameterized CSTNU
- PCSTNU() - Constructor for class it.univr.di.cstnu.algorithms.PCSTNU
-
Constructor only for the main and possible extensions.
- PCSTNU(TNGraph<CSTNUEdge>) - Constructor for class it.univr.di.cstnu.algorithms.PCSTNU
- PCSTNU(TNGraph<CSTNUEdge>, int) - Constructor for class it.univr.di.cstnu.algorithms.PCSTNU
- PCSTNU(String) - Constructor for class it.univr.di.cstnu.algorithms.PCSTNU
- plainSuffix - Static variable in class it.univr.di.cstnu.util.GraphML2Luke
-
Default extension
- popupEditingPlugin - Variable in class it.univr.di.cstnu.visualization.EditingModalGraphMouse
-
Plugin for editing
- positionInitializer - Static variable in class it.univr.di.cstnu.visualization.CSTNLayout
-
Returns the coordinates of a node as a Point2d object.
- positionInitializer - Static variable in class it.univr.di.cstnu.visualization.CSTNUStaticLayout
-
It is used to get the coordinates of the node stored inside the LabelNode object.
- potentialR3(LabeledNode[], AbstractCSTN.NodesToCheck, Instant) - Method in class it.univr.di.cstnu.algorithms.CSTNPotential
-
Apply rule R3 to the potentials of each node in nodesToCheck.
- potentialUpdate - Variable in class it.univr.di.cstnu.algorithms.AbstractCSTN.CSTNCheckStatus
-
Counters #applications of potential update
- preferredSize - Variable in class it.univr.di.cstnu.visualization.TNEditor
-
the preferred sizes for the two views
- prefix - Static variable in class it.univr.di.cstnu.graph.TNGraphMLReader
- present - Enum constant in enum class it.univr.di.labeledvalue.ALabel.State
-
A negated literal is true if the truth value assigned to its proposition letter is false; otherwise, it is false.
- present - Variable in class it.univr.di.cstnu.util.ObjectArrayFIFOSetQueue
-
To quickly check if an element is present.
- printProgress() - Method in class it.univr.di.cstnu.util.RunMeter
- printProgress(long) - Method in class it.univr.di.cstnu.util.RunMeter
-
Each call of method, advance `this.current` and print the meter.
- printVersion() - Method in class it.univr.di.cstnu.util.CSTNU2CSTNPSU
-
Print a version of this class in System.out.
- printVersion() - Method in class it.univr.di.cstnu.util.STNUDensifier
-
Print the version of this class in System.out.
- probabilityMass - Variable in class it.univr.di.cstnu.algorithms.PSTN.PSTNCheckStatus
-
the conjuncted probability mass obtained by setting the contingent bounds in
PSTN.PSTNCheckStatus.approximatingSTNU
. - propagationCalls - Variable in class it.univr.di.cstnu.algorithms.STN.STNCheckStatus
-
Number of propagations
- propagationOnlyToZ - Variable in class it.univr.di.cstnu.algorithms.AbstractCSTN
-
Check using the full set of rules R0, qR0, R3, qR3, LP, qLP or the reduced set qR0, qR3, LP.
- propertyChange(PropertyChangeEvent) - Method in class it.univr.di.cstnu.graph.TNGraph
- propertyChange(PropertyChangeEvent) - Method in class it.univr.di.cstnu.graph.TNGraph.UnmodifiableTNGraph
- PROPOSITION_ARRAY - Static variable in class it.univr.di.labeledvalue.Literal
-
List of possible propositions managed by this class.
- PROPOSITION_RANGE - Static variable in class it.univr.di.labeledvalue.Literal
-
R.E. representation of PROPOSITION_ARRAY
- propositionObserved - Variable in class it.univr.di.cstnu.graph.LabeledNode
-
Possible proposition observed.
- propositions - Variable in class it.univr.di.cstnu.util.Checker.GlobalStatisticKey
-
# of propositions
- PROPOSITIONS - Static variable in class it.univr.di.labeledvalue.Literal
-
R.E. representation of allowed propositions.
- prototypalLink - Variable in class it.univr.di.cstnu.algorithms.CSTNPSU
-
Cache of the prototypal link
- PrototypalLink(CSTNPSU.PrototypalLink) - Constructor for class it.univr.di.cstnu.algorithms.CSTNPSU.PrototypalLink
-
Copy constructor
- PrototypalLink(String, int, int, int, int, int, String) - Constructor for class it.univr.di.cstnu.algorithms.CSTNPSU.PrototypalLink
-
Creates an immutable prototypal link.
- PSTN - Class in it.univr.di.cstnu.algorithms
-
Simple class to represent a Probabilistic Simple Temporal Constraint Networks (PSTN), where the edge weights are signed integers.
- PSTN - Enum constant in enum class it.univr.di.cstnu.graph.TNGraph.NetworkType
-
Probabilistic simple temporal network.
- PSTN() - Constructor for class it.univr.di.cstnu.algorithms.PSTN
-
Default constructor.
- PSTN(TNGraph<STNUEdge>) - Constructor for class it.univr.di.cstnu.algorithms.PSTN
-
Given a PSTN graph, it uses it as a network (does not make a copy).
- PSTN(TNGraph<STNUEdge>, int, double, double, OptimizationEngine) - Constructor for class it.univr.di.cstnu.algorithms.PSTN
- PSTN(TNGraph<STNUEdge>, int, double, OptimizationEngine) - Constructor for class it.univr.di.cstnu.algorithms.PSTN
-
Given an STNU graph, it uses it as a base for it (does not make a copy).
- PSTN.PSTNCheckStatus - Class in it.univr.di.cstnu.algorithms
-
Extends STNCheckStatus to represent the result of the approximating STNU.
- PSTNCheckStatus() - Constructor for class it.univr.di.cstnu.algorithms.PSTN.PSTNCheckStatus
- PSTNRTEBenchmarkRunner - Class in it.univr.di.cstnu.util
-
A simple class to determine some statistics about the execution of PSTNs
- PSTNRTEBenchmarkRunner() - Constructor for class it.univr.di.cstnu.util.PSTNRTEBenchmarkRunner
- PSTNRTEBenchmarkRunner.ExitExecution - Enum Class in it.univr.di.cstnu.util
-
The possible exit of an RTE
- PSTNRTEBenchmarkRunner.PSTNSituation - Record Class in it.univr.di.cstnu.util
-
Maintains the map (contingent node, chosen duration of its contingent link), the number of chosen durations outside the bounds of the relative contingent link, and the conjunct probability mass of the contingent ranges with respect to the probability distribution functions of the contingent durations.
- PSTNSituation(Object2IntMap<LabeledNode>, double, int, double) - Constructor for record class it.univr.di.cstnu.util.PSTNRTEBenchmarkRunner.PSTNSituation
-
Creates an instance of a
PSTNSituation
record class. - put(ALabelAlphabet.ALetter) - Method in class it.univr.di.labeledvalue.ALabel
- put(ALabelAlphabet.ALetter) - Method in class it.univr.di.labeledvalue.ALabelAlphabet
-
Puts the element v in the map if not present.
- put(Label, int) - Method in class it.univr.di.labeledvalue.LabeledIntHierarchyMap
- put(Label, int) - Method in interface it.univr.di.labeledvalue.LabeledIntMap.LabeledIntMapView
-
Object Read-only.
- put(Label, int) - Method in interface it.univr.di.labeledvalue.LabeledIntMap
-
Put a label with value
i
if labell
is not null and there is no labeled value in the set with labell
, or it is present but with a value higher thanl
. - put(Label, int) - Method in class it.univr.di.labeledvalue.LabeledIntSimpleMap
-
Deprecated.
- put(Label, int) - Method in class it.univr.di.labeledvalue.LabeledIntTreeMap
-
Put a label with value
i
if labell
is not null and there is no labeled value in the set with labell
, or it is present but with a value higher thanl
. - putAll(LabeledIntMap) - Method in interface it.univr.di.labeledvalue.LabeledIntMap.LabeledIntMapView
- putAll(LabeledIntMap) - Method in interface it.univr.di.labeledvalue.LabeledIntMap
-
Put all elements of `inputMap` into the current one without making a defensive copy.
- putDistance(LabeledNode, LabeledNode, int) - Method in interface it.univr.di.cstnu.util.GraphDistances
-
Sets the new distance between a source node and the destination node.
- putDistance(LabeledNode, LabeledNode, int) - Method in class it.univr.di.cstnu.util.GraphDistancesImpl
- putDistances(LabeledNode, Object2IntMap<LabeledNode>) - Method in interface it.univr.di.cstnu.util.GraphDistances
-
Sets the new distance between a source node and all destination nodes in destinations.
- putDistances(LabeledNode, Object2IntMap<LabeledNode>) - Method in class it.univr.di.cstnu.util.GraphDistancesImpl
- putForcibly(Label, int) - Method in class it.univr.di.labeledvalue.LabeledIntHierarchyMap
-
Put the labeled value without any control.
- putForcibly(Label, int) - Method in interface it.univr.di.labeledvalue.LabeledIntMap
-
Put the labeled value without any control.
- putForcibly(Label, int) - Method in class it.univr.di.labeledvalue.LabeledIntSimpleMap
-
Deprecated.Put the labeled value without any control.
- putForcibly(Label, int) - Method in class it.univr.di.labeledvalue.LabeledIntTreeMap.LabeledIntTreeMapView
-
Object Read-only.
- putForcibly(Label, int) - Method in class it.univr.di.labeledvalue.LabeledIntTreeMap
- putLabeledPotential(Label, int) - Method in class it.univr.di.cstnu.graph.LabeledNode
-
Puts the labeled value (value, l) into the potential map.
- putLabeledUpperPotential(Label, int) - Method in class it.univr.di.cstnu.graph.LabeledNode
-
Puts the labeled value (value, l) into the upper potential map.
- putLabeledValue(Label, int) - Method in class it.univr.di.cstnu.graph.BasicCSTNUEdgePluggable
- putLabeledValue(Label, int) - Method in interface it.univr.di.cstnu.graph.CSTNEdge
- putLabeledValue(Label, int) - Method in class it.univr.di.cstnu.graph.CSTNEdgePluggable
- putLowerCaseValue(Label, ALabel, int) - Method in interface it.univr.di.cstnu.graph.BasicCSTNUEdge
-
Set or add a lower label constraint with delay i for the node n with label l.
- putLowerCaseValue(Label, ALabel, int) - Method in class it.univr.di.cstnu.graph.CSTNPSUEdgePluggable
- putLowerCaseValue(Label, ALabel, int) - Method in class it.univr.di.cstnu.graph.CSTNUEdgePluggable
- putTriple(Label, ALabel, int) - Method in class it.univr.di.labeledvalue.LabeledALabelIntTreeMap.LabeledALabelIntTreeMapView
-
Object Read-only.
- putTriple(Label, ALabel, int) - Method in class it.univr.di.labeledvalue.LabeledALabelIntTreeMap
-
Put the triple
(p,l,i)
into the map. - putUpperCaseValue(Label, ALabel, int) - Method in interface it.univr.di.cstnu.graph.BasicCSTNUEdge
-
Put an upper label constraint with delay i for the node name n with label l.
- putUpperCaseValue(Label, ALabel, int) - Method in class it.univr.di.cstnu.graph.BasicCSTNUEdgePluggable
Q
- QLOOP_VALUE - Static variable in class it.univr.di.cstnu.util.CSTNRandomGenerator
-
Default negative value of each qLoop
- qloopFinder - Enum constant in enum class it.univr.di.cstnu.graph.Edge.ConstraintType
-
The edge represents an internal one used by the loop finder
R
- r0calls - Variable in class it.univr.di.cstnu.algorithms.AbstractCSTN.CSTNCheckStatus
-
Counters #applications of r0 rule
- r3calls - Variable in class it.univr.di.cstnu.algorithms.AbstractCSTN.CSTNCheckStatus
-
Counters #applications of r3 rule
- RANDOM_EXECUTION_STRATEGY - Enum constant in enum class it.univr.di.cstnu.algorithms.STNURTE.StrategyEnum
-
Returns a random execution time,
r
, in the allowed interval[l, u]
with all nodes that can be executed at that time. - rangeFactor - Variable in class it.univr.di.cstnu.algorithms.PSTN
-
Factor used to determine the bounds of a contingent link from location and the standard deviation of the log-normal distribution in
PSTN.buildApproxSTNU()
- reactionTime - Variable in class it.univr.di.cstnu.algorithms.AbstractCSTN
-
WD2.2 epsilon value, also called `reaction time` in ICAPS 18.
- reactionTime - Variable in class it.univr.di.cstnu.visualization.TNEditor
-
Reaction time for CSTN
- readGraph(File, Class<? extends E>) - Method in class it.univr.di.cstnu.graph.TNGraphMLReader
-
Reads graphFile and returns the corresponding graph as a TNGraph object.
- readGraph(String, Class<? extends E>) - Method in class it.univr.di.cstnu.graph.TNGraphMLReader
-
Reads graphXML and returns the corresponding graph as a TNGraph object.
- rebuildInternalMaps() - Method in class it.univr.di.cstnu.algorithms.STNU
-
Rebuilds internal structures.
- remove(byte) - Method in class it.univr.di.labeledvalue.ALabel
- remove(char) - Method in class it.univr.di.labeledvalue.Label
-
Returns a new label that is a copy of
this
withoutproposition
if it is present. - remove(LabeledNode) - Method in class it.univr.di.cstnu.util.ActiveWaits
-
Remove the wait associated with the contingent from the queue.
- remove(ALabel) - Method in class it.univr.di.labeledvalue.ALabel
-
It removes all ALetters in ALabel from the current label.
- remove(ALabel) - Method in class it.univr.di.labeledvalue.LabeledALabelIntTreeMap
- remove(ALabelAlphabet.ALetter) - Method in class it.univr.di.labeledvalue.ALabel.EmptyLabel
- remove(ALabelAlphabet.ALetter) - Method in class it.univr.di.labeledvalue.ALabel
-
It removes the ALetter if it is present.
- remove(ALabelAlphabet.ALetter[]) - Method in class it.univr.di.labeledvalue.ALabel.EmptyLabel
- remove(ALabelAlphabet.ALetter[]) - Method in class it.univr.di.labeledvalue.ALabel
-
It removes all ALetters in inputSet from the current label.
- remove(Label) - Method in class it.univr.di.labeledvalue.Label
-
Returns a new label copy of
this
where all literals with names in inputLabel are removed. - remove(Label) - Method in class it.univr.di.labeledvalue.LabeledIntHierarchyMap
- remove(Label) - Method in interface it.univr.di.labeledvalue.LabeledIntMap.LabeledIntMapView
- remove(Label) - Method in interface it.univr.di.labeledvalue.LabeledIntMap
-
Remove the label
l
from the map. - remove(Label) - Method in class it.univr.di.labeledvalue.LabeledIntSimpleMap
-
Deprecated.
- remove(Label) - Method in class it.univr.di.labeledvalue.LabeledIntTreeMap
-
Remove the label
l
from the map. - remove(Label, ALabel) - Method in class it.univr.di.labeledvalue.LabeledALabelIntTreeMap.LabeledALabelIntTreeMapView
-
Object Read-only.
- remove(Label, ALabel) - Method in class it.univr.di.labeledvalue.LabeledALabelIntTreeMap
- remove(Literal) - Method in class it.univr.di.labeledvalue.Label
-
Returns a new label that is a copy of
this
whereliteral
is removed if it is present. - remove(Object) - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN.NodesToCheck
- remove(Object) - Method in class it.univr.di.cstnu.util.ObjectArrayFIFOSetQueue
- remove(Object) - Method in class it.univr.di.cstnu.util.ObjectPair
- removeAll(Collection<?>) - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN.NodesToCheck
- removeAll(Collection<?>) - Method in class it.univr.di.cstnu.util.ObjectArrayFIFOSetQueue
- removeAll(Collection<?>) - Method in class it.univr.di.cstnu.util.ObjectPair
- removeChildrenOfUnknown(Label) - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN
-
Returns a new label removing all children of possibly present unknown literals in
l
. - removeDistance(LabeledNode, LabeledNode) - Method in interface it.univr.di.cstnu.util.GraphDistances
-
Remove the distance between source node and destination one.
- removeDistance(LabeledNode, LabeledNode) - Method in class it.univr.di.cstnu.util.GraphDistancesImpl
- removeEdge(E) - Method in class it.univr.di.cstnu.graph.TNGraph
- removeEdge(String) - Method in class it.univr.di.cstnu.graph.TNGraph
-
Removes the edge from this graph and clears all cache data structures that could contain the removed edge.
- removeEdge(String) - Method in class it.univr.di.cstnu.graph.TNGraph.UnmodifiableTNGraph
-
Unsupported.
- removeEdge(K) - Method in class it.univr.di.cstnu.graph.TNGraph.UnmodifiableTNGraph
-
Unsupported.
- removeEmptyEdges() - Method in class it.univr.di.cstnu.graph.TNGraph
-
Removes all empty edges in the graph.
- removeEmptyEdges() - Method in class it.univr.di.cstnu.graph.TNGraph.UnmodifiableTNGraph
-
Unsupported.
- removeLabeledPotential(Label) - Method in class it.univr.di.cstnu.graph.LabeledNode
-
Removes the labeled potential associated with label l, if it exists.
- removeLabeledUpperPotential(Label) - Method in class it.univr.di.cstnu.graph.LabeledNode
-
Removes the labeled upper potential associated with label l, if it exists.
- removeLabeledValue(Label) - Method in interface it.univr.di.cstnu.graph.CSTNEdge
-
Remove the value labeled by l from the map.
- removeLabeledValue(Label) - Method in class it.univr.di.cstnu.graph.CSTNEdgePluggable
-
Remove the value labeled by l from the map.
- removeLabeledValuesBelongingToNegativeScenarios() - Method in class it.univr.di.cstnu.algorithms.OSTNU
-
Removes all labeled values belonging to negative scenarios.
- removeLowerCaseValue() - Method in interface it.univr.di.cstnu.graph.CSTNUEdge
-
Removes the lower-case value from the edge.
- removeLowerCaseValue() - Method in class it.univr.di.cstnu.graph.CSTNUEdgePluggable
- removeLowerCaseValue(Label, ALabel) - Method in interface it.univr.di.cstnu.graph.CSTNPSUEdge
- removeLowerCaseValue(Label, ALabel) - Method in class it.univr.di.cstnu.graph.CSTNPSUEdgePluggable
- removeObserver(String, PropertyChangeListener) - Method in class it.univr.di.cstnu.graph.AbstractComponent
-
Removes a specific listener
- removeUpperCaseValue(Label, ALabel) - Method in interface it.univr.di.cstnu.graph.BasicCSTNUEdge
-
Remove the upper label for node name n with label l.
- removeUpperCaseValue(Label, ALabel) - Method in class it.univr.di.cstnu.graph.BasicCSTNUEdgePluggable
- removeVertex(LabeledNode) - Method in class it.univr.di.cstnu.graph.TNGraph
-
Removes the given node and all edges having it as an endpoint.
- removeVertex(LabeledNode) - Method in class it.univr.di.cstnu.graph.TNGraph.UnmodifiableTNGraph
-
Unsupported.
- Represents the behavior of an STNU edge. - Search tag in interface it.univr.di.cstnu.graph.STNUEdge
- Section
- requirement - Enum constant in enum class it.univr.di.cstnu.graph.Edge.ConstraintType
-
The edge represents a user requirement
- reset() - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN.CSTNCheckStatus
-
Reset all indexes.
- reset() - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN
-
Resets all internal structures but not g.
- reset() - Method in class it.univr.di.cstnu.algorithms.CSTNPSU
-
Resets all internal structures
- reset() - Method in class it.univr.di.cstnu.algorithms.CSTNU.CSTNUCheckStatus
- reset() - Method in class it.univr.di.cstnu.algorithms.CSTNU
-
Resets all internal structures
- reset() - Method in class it.univr.di.cstnu.algorithms.OSTNU.OSTNUCheckStatus
- reset() - Method in class it.univr.di.cstnu.algorithms.OSTNU
-
Resets all internal structures
- reset() - Method in class it.univr.di.cstnu.algorithms.PSTN
-
Resets all internal structures.
- reset() - Method in class it.univr.di.cstnu.algorithms.STN
-
Resets all internal structures
- reset() - Method in class it.univr.di.cstnu.algorithms.STN.STNCheckStatus
-
Reset all indexes.
- reset() - Method in class it.univr.di.cstnu.algorithms.STNU
-
Resets all internal structures.
- reset() - Method in class it.univr.di.cstnu.algorithms.STNU.STNUCheckStatus
-
Reset all indexes.
- reset() - Method in class it.univr.di.cstnu.visualization.CSTNUStaticLayout
-
It has been erased.
- resetDerivedGraphStatus() - Method in class it.univr.di.cstnu.visualization.TNEditor
- resetLabeledValue() - Method in interface it.univr.di.cstnu.graph.STNUEdge
-
Removes the labeled value and make the edges an ordinary constraint.
- resetLabeledValue() - Method in class it.univr.di.cstnu.graph.STNUEdgeInt
-
Removes the labeled value and makes the edges an ordinary constraint if it was contingent.
- resolveEdgeDerivation(STNUEdge) - Method in class it.univr.di.cstnu.algorithms.STNU.STNUCheckStatus
- retainAll(Collection<?>) - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN.NodesToCheck
- retainAll(Collection<?>) - Method in class it.univr.di.cstnu.util.ObjectArrayFIFOSetQueue
- retainAll(Collection<?>) - Method in class it.univr.di.cstnu.util.ObjectPair
- reverse() - Method in class it.univr.di.cstnu.graph.TNGraph
-
Reverse (transpose) the current graph.
- reverse() - Method in class it.univr.di.cstnu.graph.TNGraph.UnmodifiableTNGraph
-
Unsupported.
- reverse() - Method in class it.univr.di.cstnu.graph.TNPredecessorGraph
-
Transpose the predecessor graph
- REWEIGHT_DISTANCES(GraphDistances, Object2IntMap<LabeledNode>, boolean) - Static method in interface it.univr.di.cstnu.util.GraphAlgs
-
Re-weights all distances using the potential function.
- REWEIGHT_EDGES(TNGraph<E>, Object2IntMap<LabeledNode>) - Static method in interface it.univr.di.cstnu.util.GraphAlgs
-
Re-weights all edge weights using the potential function.
- rG1G3(LabeledNode, LabeledNode, LabeledNode, CSTNPSUEdge, CSTNPSUEdge, CSTNPSUEdge) - Method in class it.univr.di.cstnu.algorithms.CSTNPSU
-
Applies rules rG1 and rG3 of Table 1 in 'Extending CSTN with partially shrinkable uncertainty' (TIME18).
- rG2(LabeledNode, LabeledNode, LabeledNode, CSTNPSUEdge, CSTNPSUEdge, CSTNPSUEdge) - Method in class it.univr.di.cstnu.algorithms.CSTNPSU
-
Applies
rG2
rule. - rG4(LabeledNode, CSTNPSUEdge) - Method in class it.univr.di.cstnu.algorithms.CSTNPSU
-
Applies
rG4
rule. - rG5rG6rG7(LabeledNode, LabeledNode, LabeledNode, CSTNPSUEdge, CSTNPSUEdge, CSTNPSUEdge) - Method in class it.univr.di.cstnu.algorithms.CSTNPSU
-
Applies rules
rG5 and rG6 and rG7
of Table 2 paper submitted to CP20. - rG8(LabeledNode, LabeledNode, LabeledNode, CSTNPSUEdge, CSTNPSUEdge, CSTNPSUEdge, CSTNPSUEdge) - Static method in class it.univr.di.cstnu.algorithms.CSTNPSU
-
Updates the upper bound of a guarded range.
- rG9(LabeledNode, LabeledNode, LabeledNode, CSTNPSUEdge, CSTNPSUEdge, CSTNPSUEdge, CSTNPSUEdge) - Static method in class it.univr.di.cstnu.algorithms.CSTNPSU
-
Updates the lower bound of a guarded range.
- rM1(LabeledNode, CSTNPSUEdge) - Method in class it.univr.di.cstnu.algorithms.CSTNPSU
-
Implements the CSTNPSU rM1 rule assuming instantaneous reaction and a streamlined network.
This differs fromAbstractCSTN.labelModificationR0qR0(LabeledNode, LabeledNode, CSTNEdge)
because it also checks upper-case values. - rM2(LabeledNode, CSTNPSUEdge) - Method in class it.univr.di.cstnu.algorithms.CSTNPSU
-
Implements the CSTNPSU rM2 rule assuming instantaneous reaction and a streamlined network.
- root - Variable in class it.univr.di.labeledvalue.LabeledIntHierarchyMap
-
Root of hierarchy
- rowForAppButtons - Variable in class it.univr.di.cstnu.visualization.TNEditor
- rowForOSTNUButtons - Variable in class it.univr.di.cstnu.visualization.TNEditor
- rowForSTNButtons - Variable in class it.univr.di.cstnu.visualization.TNEditor
- rowForSTNUButtons - Variable in class it.univr.di.cstnu.visualization.TNEditor
- rte(STNURTE.Strategy, STNURTE.Strategy) - Method in class it.univr.di.cstnu.algorithms.STNURTE
-
Real-Time Execution (RTE)
- RTED(boolean) - Constructor for class it.univr.di.cstnu.algorithms.STNURTE.RTED
- RTED(Set<LabeledNode>, int) - Constructor for class it.univr.di.cstnu.algorithms.STNURTE.RTED
- rtedStrategy - Variable in class it.univr.di.cstnu.algorithms.STNURTE.RTEState
-
Strategy used by RTED to choose a 'time instant'
- RTEState() - Constructor for class it.univr.di.cstnu.algorithms.STNURTE.RTEState
-
Default constructor
- RUL2018 - Enum constant in enum class it.univr.di.cstnu.algorithms.STNU.CheckAlgorithm
-
Cairo, Rizzi, and Hunsberger RUL^- algorithm
- rul2018ApplyRelaxLower(LabeledNode, LabeledNode, int) - Method in class it.univr.di.cstnu.algorithms.STNU
-
RUL- algorithm: applyRelaxLower
- rul2018ApplyUpper(LabeledNode, int, int, LabeledNode) - Method in class it.univr.di.cstnu.algorithms.STNU
-
RUL- algorithm: applyUpper procedure.
- rul2018CloseRelaxLower(Object2IntMap<LabeledNode>, LabeledNode, int) - Method in class it.univr.di.cstnu.algorithms.STNU
-
RUL- algorithm: cloneRelaxLower procedure
- rul2018UpdatePotential(Object2IntMap<LabeledNode>, LabeledNode) - Method in class it.univr.di.cstnu.algorithms.STNU
-
RUL- algorithm: updatePotential procedure.
- RUL2021 - Enum constant in enum class it.univr.di.cstnu.algorithms.STNU.CheckAlgorithm
-
Luke's version of RUL^- algorithm
- rul2021BackPropagation(STNUEdge, STNU.RULGlobalInfo) - Method in class it.univr.di.cstnu.algorithms.STNU
-
Luke Hunsberger version of RUL- back propagation algorithm.
- rul2021FwdPropNotDC(LabeledNode, int, Object2IntMap<LabeledNode>, Object2IntMap<LabeledNode>) - Method in class it.univr.di.cstnu.algorithms.STNU
-
Auxiliary procedure for the Luke Hunsberger implementation of RUL- algorithm.
- rul2021NewApplyRelaxLower(LabeledNode, int, int) - Method in class it.univr.di.cstnu.algorithms.STNU
-
Auxiliary procedure for the Luke Hunsberger implementation of RUL- algorithm.
- rul2021OneStepBackProp(LabeledNode, int, ExtendedPriorityQueue<LabeledNode>, STNU.RULGlobalInfo, STNU.RULLocalInfo) - Method in class it.univr.di.cstnu.algorithms.STNU
-
Auxiliary procedure for the Luke Hunsberger version of RUL-.
- ruleAPlus_AparameterPlus(LabeledNode, LabeledNode, LabeledNode, CSTNUEdge, CSTNUEdge, CSTNUEdge) - Method in class it.univr.di.cstnu.algorithms.PCSTNU
-
Apply A^+, or A^+-Parameter of paper about Parameter-CSTNU.
- ruleBPlus_BparameterPlus(LabeledNode, LabeledNode, LabeledNode, CSTNUEdge, CSTNUEdge, CSTNUEdge) - Method in class it.univr.di.cstnu.algorithms.PCSTNU
-
Apply B^+, or B^+-Parameter of paper about Parameter-CSTNU.
- RULGlobalInfo(Object2IntMap<LabeledNode>, int) - Constructor for class it.univr.di.cstnu.algorithms.STNU.RULGlobalInfo
-
Default constructor
- RULLocalInfo(int) - Constructor for class it.univr.di.cstnu.algorithms.STNU.RULLocalInfo
-
Default constructor
- RunMeter - Class in it.univr.di.cstnu.util
-
Simple class for making a meter in the console.
- RunMeter(long, long, long) - Constructor for class it.univr.di.cstnu.util.RunMeter
- rUpdateBoundsUsingZ(LabeledNode, LabeledNode, LabeledNode, CSTNPSUEdge, CSTNPSUEdge, CSTNPSUEdge) - Static method in class it.univr.di.cstnu.algorithms.CSTNPSU
-
Applies the propagation rule only on labeled values in the triangle
S
- sample() - Method in class it.univr.di.cstnu.util.LogNormalDistributionParameter
- save(TNGraph<? extends Edge>) - Method in class it.univr.di.cstnu.graph.TNGraphMLWriter
-
Helper method for making
GraphMLWriter.save(Hypergraph, Writer)
easier. - save(TNGraph<? extends Edge>, File) - Method in class it.univr.di.cstnu.graph.TNGraphMLWriter
-
Helper method for making
GraphMLWriter.save(Hypergraph, Writer)
easier. - save(TNGraph<? extends Edge>, Writer) - Method in class it.univr.di.cstnu.graph.TNGraphMLWriter
- saveGraphToFile() - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN
-
Helper method to make it easier to store the resulting graph during a check.
- saveGraphToFile() - Method in class it.univr.di.cstnu.algorithms.PSTN
-
Stores the graph after a check of the file.
- saveGraphToFile() - Method in class it.univr.di.cstnu.algorithms.STN
-
Stores the graph after a check into the file
STN.fOutput
. - saveGraphToFile() - Method in class it.univr.di.cstnu.algorithms.STNU
-
Stores the graph after a check of the file.
- saveGraphToFile(TNGraph<? extends Edge>, File) - Method in class it.univr.di.cstnu.visualization.TNEditor
- saveTNResultButton - Variable in class it.univr.di.cstnu.visualization.TNEditor
-
Result Save Button
- SCANNED - Enum constant in enum class it.univr.di.cstnu.graph.LabeledNode.Status
- schedule - Variable in class it.univr.di.cstnu.algorithms.STNURTE.RTEState
-
Schedule.
- SEP_CASE - Static variable in interface it.univr.di.cstnu.graph.STNUEdge
-
Constant
SEP_CASE=":"
- serialVersionUID - Static variable in class it.univr.di.cstnu.algorithms.PSTN.PSTNCheckStatus
- serialVersionUID - Static variable in class it.univr.di.cstnu.algorithms.STN.STNCheckStatus
-
Serial number
- serialVersionUID - Static variable in class it.univr.di.cstnu.algorithms.STNU.STNUCheckStatus
- serialVersionUID - Static variable in class it.univr.di.cstnu.algorithms.STNU.STNUPath
- serialVersionUID - Static variable in class it.univr.di.cstnu.graph.STNUEdge.CaseLabel
-
Serial number
- serialVersionUID - Static variable in class it.univr.di.cstnu.graph.STNUEdgeInt
-
Serial number
- serialVersionUID - Static variable in class it.univr.di.cstnu.visualization.CSTNLayout
- serialVersionUID - Static variable in class it.univr.di.labeledvalue.AbstractLabeledIntMap
-
Serial number
- serialVersionUID - Static variable in class it.univr.di.labeledvalue.ALabelAlphabet
-
Serial number
- serialVersionUID - Static variable in interface it.univr.di.labeledvalue.LabeledIntMap
-
Serial UID
- set(int, int) - Method in class it.univr.di.cstnu.util.TimeInterval
-
Updates the bounds.
- set(STNUEdge) - Method in class it.univr.di.cstnu.algorithms.STNU.STNUPath
-
Sets the path using the input
- setAfter(LabeledNode) - Method in class it.univr.di.cstnu.graph.LabeledNode
- setALabel(ALabel) - Method in class it.univr.di.cstnu.graph.LabeledNode
-
Sets the ALabel of the node.
- setAllPotential(int) - Method in class it.univr.di.cstnu.graph.TNGraph
-
Sets the potential of each node to
v
. - setBefore(LabeledNode) - Method in class it.univr.di.cstnu.graph.LabeledNode
- setCheckAlgorithm(STNU.CheckAlgorithm) - Method in class it.univr.di.cstnu.algorithms.STNU.STNUCheckStatus
- setConstraintType(Edge.ConstraintType) - Method in class it.univr.di.cstnu.graph.AbstractEdge
- setConstraintType(Edge.ConstraintType) - Method in interface it.univr.di.cstnu.graph.Edge
- setContingent(boolean) - Method in class it.univr.di.cstnu.graph.LabeledNode
- setContingentAlsoAsOrdinary(boolean) - Method in class it.univr.di.cstnu.algorithms.CSTNU
-
Setter for the field
contingentAlsoAsOrdinary
. - setContingentAlsoAsOrdinary(boolean) - Method in class it.univr.di.cstnu.algorithms.STNU
- setControllability(boolean) - Method in class it.univr.di.cstnu.algorithms.CSTNU.CSTNUCheckStatus
-
Set the controllability value!
- setControllability(boolean) - Method in class it.univr.di.cstnu.algorithms.OSTNU.OSTNUCheckStatus
-
Set the controllability value!
- setControllability(boolean) - Method in class it.univr.di.cstnu.algorithms.STNU.STNUCheckStatus
-
Sets the controllability value
- setCstnEditor(TNEditor) - Method in class it.univr.di.cstnu.visualization.CSTNUGraphAttributeEditingMousePlugin
- setCurrentLayout(AbstractLayout<LabeledNode, ? extends Edge>) - Method in class it.univr.di.cstnu.visualization.CSTNLayout
- setDefaultConsistencyCheckAlg(STN.CheckAlgorithm) - Method in class it.univr.di.cstnu.algorithms.STN
- setDefaultControllabilityCheckAlg(STNU.CheckAlgorithm) - Method in class it.univr.di.cstnu.algorithms.STNU
- setDefaultParametersForNetwork(TNGraph.NetworkType) - Method in class it.univr.di.cstnu.visualization.TNEditor
-
Set all default parameters about the editor according to the input type.
- setDifference(char[], char[]) - Static method in class it.univr.di.cstnu.util.CSTNRandomGenerator
- setEdgeEditingPlugin(EdgeSupplier<E>) - Method in class it.univr.di.cstnu.visualization.EditingModalGraphMouse
- setEdgeFactory(Supplier<E>) - Method in class it.univr.di.cstnu.visualization.EditingGraphMousePlugin
-
setEdgeFactory.
- setEdgeFactory(Supplier<E>) - Method in class it.univr.di.cstnu.visualization.EditingPopupGraphMousePlugin
- setEdgeSupport(EdgeSupport<V, E>) - Method in class it.univr.di.cstnu.visualization.EditingGraphMousePlugin
-
Setter for the field
edgeSupport
. - setEditingMode() - Method in class it.univr.di.cstnu.visualization.EditingModalGraphMouse
-
setEditingMode.
- setfOutput(File) - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN
- setfOutput(File) - Method in class it.univr.di.cstnu.algorithms.PSTN
- setfOutput(File) - Method in class it.univr.di.cstnu.algorithms.STN
- setfOutput(File) - Method in class it.univr.di.cstnu.algorithms.STNU
- setG(TNGraph<E>) - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN
-
Considers the given graph as the graph to check (the graph will be modified).
- setG(TNGraph<STNEdge>) - Method in class it.univr.di.cstnu.algorithms.STN
-
Considers the given graph as the graph to check (the graph will be modified).
- setG(TNGraph<STNUEdge>) - Method in class it.univr.di.cstnu.algorithms.PSTN
-
Considers the given graph as the graph to check (the graph will be modified).
- setG(TNGraph<STNUEdge>) - Method in class it.univr.di.cstnu.algorithms.STNU
-
Considers the given graph as the graph to check (the graph will be modified).
- setInitialX(int) - Method in class it.univr.di.cstnu.visualization.CSTNLayout
- setInitialY(int) - Method in class it.univr.di.cstnu.visualization.CSTNLayout
- setInNegativeCycle(boolean) - Method in class it.univr.di.cstnu.graph.AbstractComponent
-
Sets true if the edge is in a negative cycle
- setInNegativeCycle(boolean) - Method in interface it.univr.di.cstnu.graph.Component
-
Sets true if the edge is in a negative cycle
- setInputFile(File) - Method in class it.univr.di.cstnu.graph.TNGraph
- setInputFile(File) - Method in class it.univr.di.cstnu.graph.TNGraph.UnmodifiableTNGraph
-
Unsupported.
- setLabel(Label) - Method in class it.univr.di.cstnu.graph.LabeledNode
- setLabel(String) - Method in class it.univr.di.cstnu.graph.LabeledNode
- setLabeledPotential(LabeledIntMap) - Method in class it.univr.di.cstnu.graph.LabeledNode
-
If potential is not null, it is used (not copied) as the new potential of the node.
- setLabeledPotentialCount(Label, int) - Method in class it.univr.di.cstnu.graph.LabeledNode
-
Put the value with label l into the map.
- setLabeledUpperPotential(LabeledIntMap) - Method in class it.univr.di.cstnu.graph.LabeledNode
-
If potential is not null, it is used (not copied) as the new potential of the node.
- setLabeledValue(ALabelAlphabet.ALetter, int, boolean) - Method in interface it.univr.di.cstnu.graph.STNUEdge
-
Sets the labeled weight to w of a
Edge.ConstraintType.contingent
edge. - setLabeledValue(ALabelAlphabet.ALetter, int, boolean) - Method in class it.univr.di.cstnu.graph.STNUEdgeInt
- setLabeledValue(String) - Method in interface it.univr.di.cstnu.graph.STNUEdge
-
Parses an upper/case labeled value to determine the new value for this edge.
- setLabeledValueMap(LabeledIntMap) - Method in interface it.univr.di.cstnu.graph.CSTNEdge
-
Uses inputLabeledValue as an internal labeled value map.
- setLabeledValueMap(LabeledIntMap) - Method in class it.univr.di.cstnu.graph.CSTNEdgePluggable
- setLogNormalDistributionParameter(LogNormalDistributionParameter) - Method in class it.univr.di.cstnu.graph.LabeledNode
- setLowerCaseValue(Label, ALabel, int) - Method in interface it.univr.di.cstnu.graph.CSTNUEdge
-
Set a lower-case constraint with delay i for the node n with label l.
- setLowerCaseValue(Label, ALabel, int) - Method in class it.univr.di.cstnu.graph.CSTNUEdgePluggable
- setLowerCaseValueAsConsidered(Label, ALabel, int) - Method in class it.univr.di.cstnu.graph.CSTNPSUEdgePluggable
-
Set the triple as already considered to avoid considering it again in the future.
- setLowerCaseValues(LabeledALabelIntTreeMap) - Method in interface it.univr.di.cstnu.graph.CSTNPSUEdge
- setLowerCaseValues(LabeledALabelIntTreeMap) - Method in class it.univr.di.cstnu.graph.CSTNPSUEdgePluggable
- setMode(ModalGraphMouse.Mode) - Method in class it.univr.di.cstnu.visualization.EditingModalGraphMouse
- setName(String) - Method in class it.univr.di.cstnu.graph.AbstractComponent
-
Sets the name of the component.
- setName(String) - Method in class it.univr.di.cstnu.graph.AbstractEdge
-
Sets the name of the edge.
- setName(String) - Method in class it.univr.di.cstnu.graph.AbstractNode
-
Sets the name of the node.
- setName(String) - Method in interface it.univr.di.cstnu.graph.Component
-
Set the name of the component.
- setName(String) - Method in class it.univr.di.cstnu.graph.LabeledNode
-
Overriding method to ensure that the name is coherent with ALabel.
- setName(String) - Method in class it.univr.di.cstnu.graph.TNGraph
- setName(String) - Method in class it.univr.di.cstnu.graph.TNGraph.UnmodifiableTNGraph
-
Unsupported.
- setNodeEdgeRenders(BasicVisualizationServer<LabeledNode, E>, boolean) - Static method in class it.univr.di.cstnu.visualization.TNEditor
-
Sets up vertex and edge renders.
- setObservable(char) - Method in class it.univr.di.cstnu.graph.LabeledNode
-
Set the proposition to be observed.
- setOptimizationEngine(OptimizationEngine) - Method in class it.univr.di.cstnu.algorithms.PSTN
- setOutputCleaned(boolean) - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN
-
Set to true for having the result graph cleaned of empty edges and labeled values having unknown literals.
- setOutputCleaned(boolean) - Method in class it.univr.di.cstnu.algorithms.STN
-
Set to true for having the result graph cleaned of empty edges and labeled values having unknown literals.
- setOutputCleaned(boolean) - Method in class it.univr.di.cstnu.algorithms.STNU
-
Sets to true for having the result graph cleaned of empty edges.
- setParameter(boolean) - Method in class it.univr.di.cstnu.graph.LabeledNode
- setPotential(int) - Method in class it.univr.di.cstnu.graph.LabeledNode
- setPredecessor(LabeledNode) - Method in class it.univr.di.cstnu.graph.LabeledNode
-
Set the predecessor.
- setPropagationOnlyToZ(boolean) - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN
-
Setter for the field
propagationOnlyToZ
. - setSave(boolean) - Method in class it.univr.di.cstnu.algorithms.PSTN
- setSave(boolean) - Method in class it.univr.di.cstnu.algorithms.STNU
- setShift(int) - Method in class it.univr.di.cstnu.util.LogNormalDistributionParameter
-
Registers shift.
- setSrncKind(STNU.STNUCheckStatus.SRNCKind) - Method in class it.univr.di.cstnu.algorithms.STNU.STNUCheckStatus
- setStatus(LabeledNode.Status) - Method in class it.univr.di.cstnu.graph.LabeledNode
- setTransformingMode() - Method in class it.univr.di.cstnu.visualization.EditingModalGraphMouse
- setType(TNGraph.NetworkType) - Method in class it.univr.di.cstnu.graph.TNGraph
-
Sets the type of network.
Warning: this method was introduced for setting the PSTN type because it is not simple to determine it from the kind of edges. - setUpperBoundRequested(boolean) - Method in class it.univr.di.cstnu.algorithms.CSTNPotential
- setUpperCaseValueAsConsidered(Label, ALabel, int) - Method in class it.univr.di.cstnu.graph.BasicCSTNUEdgePluggable
-
Set the triple as already considered to avoid considering it again in the future.
- setUpperCaseValueMap(LabeledALabelIntTreeMap) - Method in interface it.univr.di.cstnu.graph.BasicCSTNUEdge
- setUpperCaseValueMap(LabeledALabelIntTreeMap) - Method in class it.univr.di.cstnu.graph.BasicCSTNUEdgePluggable
- setValue(int) - Method in class it.univr.di.cstnu.graph.OSTNUEdgePluggable
-
Allows the use of values without a label because it is possible to have a better algorithm in the future that avoids labeled values.
- setValue(int) - Method in interface it.univr.di.cstnu.graph.STNEdge
-
Sets the weight to w.
- setValue(int) - Method in class it.univr.di.cstnu.graph.STNEdgeInt
- setValue(int) - Method in class it.univr.di.labeledvalue.LabeledIntHierarchyMap.HierarchyNode
- setValue(ALabel) - Method in class it.univr.di.cstnu.graph.BasicCSTNUEdgePluggable.InternalEntry
- setVertexSupport(VertexSupport<V, E>) - Method in class it.univr.di.cstnu.visualization.EditingGraphMousePlugin
-
Setter for the field
vertexSupport
. - setWithNodeLabels(boolean) - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN
- setX(double) - Method in class it.univr.di.cstnu.graph.LabeledNode
- setY(double) - Method in class it.univr.di.cstnu.graph.LabeledNode
- setZ(LabeledNode) - Method in class it.univr.di.cstnu.graph.TNGraph
-
Sets
z
as the first node (Zero node) of the temporal constraint network. - setZ(LabeledNode) - Method in class it.univr.di.cstnu.graph.TNGraph.UnmodifiableTNGraph
-
Unsupported.
- setZ(LabeledNode) - Method in class it.univr.di.cstnu.graph.TNPredecessorGraph
- shiftButtonDownMask - Static variable in class it.univr.di.cstnu.visualization.EditingGraphMousePlugin
-
Mask for button
- showCommandRow(TNGraph.NetworkType) - Method in class it.univr.di.cstnu.visualization.TNEditor
-
In the command panel, only one row of commands is visible.
- simple() - Method in record class it.univr.di.cstnu.algorithms.STNU.STNUCheckStatus.SRNCInfo
-
Returns the value of the
simple
record component. - SIMPLE_LABELEDINTMAP_CLASS - Static variable in class it.univr.di.labeledvalue.LabeledIntMapSupplier
- singleSinkShortestPaths(AbstractCSTN.NodesToCheck, Instant) - Method in class it.univr.di.cstnu.algorithms.CSTNPotential
-
Executes single-sink Bellman-Ford algorithm propagating from each in
nodesToCheck
until no new distances are determined. - singleSourceShortestPaths(AbstractCSTN.NodesToCheck, AbstractCSTN.NodesToCheck, Instant) - Method in class it.univr.di.cstnu.algorithms.CSTNPotential
-
Executes the single-source Bellman-Ford algorithm for each node in
nodesToCheck
. - situation() - Method in record class it.univr.di.cstnu.util.PSTNRTEBenchmarkRunner.PSTNSituation
-
Returns the value of the
situation
record component. - size() - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN.EdgesToCheck
- size() - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN.NodesToCheck
- size() - Method in class it.univr.di.cstnu.algorithms.STNU.STNUPath
- size() - Method in interface it.univr.di.cstnu.graph.BasicCSTNUEdge
- size() - Method in class it.univr.di.cstnu.graph.BasicCSTNUEdgePluggable
- size() - Method in class it.univr.di.cstnu.graph.CSTNEdgePluggable
- size() - Method in interface it.univr.di.cstnu.graph.Edge
- size() - Method in class it.univr.di.cstnu.graph.STNEdgeInt
- size() - Method in class it.univr.di.cstnu.util.ActiveWaits
- size() - Method in class it.univr.di.cstnu.util.ExtendedPriorityQueue
-
It runs in O(1) time.
- size() - Method in class it.univr.di.cstnu.util.ObjectArrayFIFOSetQueue
- size() - Method in class it.univr.di.cstnu.util.ObjectPair
- size() - Method in class it.univr.di.labeledvalue.AbstractLabeledIntMap
- size() - Method in class it.univr.di.labeledvalue.ALabel.EmptyLabel
- size() - Method in class it.univr.di.labeledvalue.ALabel
- size() - Method in class it.univr.di.labeledvalue.ALabelAlphabet
- size() - Method in class it.univr.di.labeledvalue.Label
- size() - Method in class it.univr.di.labeledvalue.LabeledALabelIntTreeMap
- size() - Method in class it.univr.di.labeledvalue.LabeledIntHierarchyMap
- size() - Method in interface it.univr.di.labeledvalue.LabeledIntMap
- size() - Method in class it.univr.di.labeledvalue.LabeledIntSimpleMap
-
Deprecated.
- solution() - Method in record class it.univr.di.cstnu.util.OptimizationEngine.OptimizationResult
-
Returns the value of the
solution
record component. - son - Variable in class it.univr.di.labeledvalue.LabeledIntHierarchyMap.HierarchyNode
-
Labeled values that subsume this.
- SON_PROBABILITY - Static variable in class it.univr.di.cstnu.util.OSTNURandomGenerator
-
Default son probability
- SON_PROBABILITY - Static variable in class it.univr.di.cstnu.util.STNURandomGenerator
-
Default son probability
- source - Variable in class it.univr.di.cstnu.algorithms.STNU.EdgeData
- splitterEntryPattern - Static variable in class it.univr.di.labeledvalue.AbstractLabeledIntMap
-
Pattern for splitting a set of labeled values.
- splitterPair - Static variable in class it.univr.di.labeledvalue.AbstractLabeledIntMap
- srn - Variable in class it.univr.di.cstnu.algorithms.PSTN.PSTNCheckStatus
-
Possible semi-reducible negative cycle;
- srnc() - Method in record class it.univr.di.cstnu.algorithms.STNU.STNUCheckStatus.SRNCInfo
-
Returns the value of the
srnc
record component. - SRNCFinderBenchmarkRunner - Class in it.univr.di.cstnu.util
-
Determines the average execution time and some statistics of the STNU SRNCycleFinder on a given set of STNUs.
- SRNCFinderBenchmarkRunner() - Constructor for class it.univr.di.cstnu.util.SRNCFinderBenchmarkRunner
- SRNCInfo(ObjectImmutableList<STNUEdge>, int, int, STNU.STNUCheckStatus.SRNCKind, STNU.STNUCheckStatus.SRNCEdges, boolean, ObjectImmutableList<STNUEdge>, int, Object2IntMap<LabeledNode>, Object2IntMap<LabeledNode>) - Constructor for record class it.univr.di.cstnu.algorithms.STNU.STNUCheckStatus.SRNCInfo
-
Creates an instance of a
SRNCInfo
record class. - srncKind - Variable in class it.univr.di.cstnu.algorithms.PSTN.PSTNCheckStatus
-
Kind of SRNC
- srncKind - Variable in class it.univr.di.cstnu.algorithms.STNU.STNUCheckStatus
-
Kind of SRNC
- srncKind() - Method in record class it.univr.di.cstnu.algorithms.STNU.STNUCheckStatus.SRNCInfo
-
Returns the value of the
srncKind
record component. - SRNCycleFinder - Enum constant in enum class it.univr.di.cstnu.algorithms.STNU.CheckAlgorithm
-
NegCycleSTNU is the RUL2021 algorithm that also returns the negative cycle when the instance is not DC.
- SRNCycleFinderApplyRL(LabeledNode, int, int) - Method in class it.univr.di.cstnu.algorithms.STNU
-
Auxiliary procedure for NegCycleSTNU algorithm.
- SRNCycleFinderBackPropagation(STNUEdge, STNU.RULGlobalInfo) - Method in class it.univr.di.cstnu.algorithms.STNU
-
A back propagation algorithm to bypass the UC edge is used by the SRNCycleFinder algorithm.
- SRNCycleFinderFwdPropNotDC(LabeledNode, int, STNU.RULLocalInfo, Object2IntMap<LabeledNode>) - Method in class it.univr.di.cstnu.algorithms.STNU
-
Propagates forward from
C
along LO-edges checking whether there is a negative-length LO-path fromC
to someX
that can be used to bypass the LC edge(A,c:x,C)
. - SRNCycleFinderTryBackProp(STNUEdge, LabeledNode, int, ExtendedPriorityQueue<LabeledNode>, STNU.RULGlobalInfo, STNU.RULLocalInfo) - Method in class it.univr.di.cstnu.algorithms.STNU
-
Auxiliary procedure for the SRNCycleFinder algorithm.
- SRNCycleFinderUpdatePotential(STNU.RULGlobalInfo, LabeledNode) - Method in class it.univr.di.cstnu.algorithms.STNU
- srnExpanded() - Method in record class it.univr.di.cstnu.algorithms.STNU.STNUCheckStatus.SRNCInfo
-
Returns the value of the
srnExpanded
record component. - SSSP_BFCT(TNGraph<E>, LabeledNode, STNEdge.EdgeValue<E>, int, STN.STNCheckStatus) - Static method in class it.univr.di.cstnu.algorithms.STN
-
Determines the minimal distance of each node from the given source (single-source-shortest-paths (SSSP)) using the Bellman-Ford-Tarjan algorithm.
It is the Bellman-Ford augmented by a cycle detection routine called 'Subtree disassembly' written by Tarjan.
If the STN graph is not consistent and the checkStatus parameter is not null, then the negative cycle is stored in the fieldSTN.STNCheckStatus.negativeCycle
.
All nodes are made reachable by Z by adding a constraint (Z, horizon, X) for each node X, where the horizon is a given parameter. - start - Variable in class it.univr.di.cstnu.util.ObjectArrayFIFOSetQueue
-
The start position in
ObjectArrayFIFOSetQueue.backingArray
. - started - Enum constant in enum class it.univr.di.cstnu.algorithms.STNU.ElementStatus
- startTime - Variable in class it.univr.di.cstnu.util.RunMeter
- stateAsString(char) - Static method in class it.univr.di.labeledvalue.Literal
- Std - Enum constant in enum class it.univr.di.cstnu.algorithms.AbstractCSTN.DCSemantics
-
Standard semantics
- stdDevExecutionTimeNS - Variable in class it.univr.di.cstnu.algorithms.STN.STNCheckStatus
-
Standard Deviation of execution time if this last one is a mean.
- stdDevPartialExecutionTimeNS - Variable in class it.univr.di.cstnu.algorithms.STN.STNCheckStatus
- step() - Method in class it.univr.di.cstnu.visualization.CSTNLayout
- step() - Method in class it.univr.di.cstnu.visualization.CSTNUStaticLayout
- stn - Variable in class it.univr.di.cstnu.visualization.TNEditor
-
STN checker
- STN - Class in it.univr.di.cstnu.algorithms
-
Represents a Simple Temporal Network (STN), and it contains some methods to manipulate and check an STN instance.
- STN - Enum constant in enum class it.univr.di.cstnu.graph.TNGraph.NetworkType
-
Simple Temporal Network
- STN() - Constructor for class it.univr.di.cstnu.algorithms.STN
-
Default constructor.
- STN(TNGraph<STNEdge>) - Constructor for class it.univr.di.cstnu.algorithms.STN
- STN(TNGraph<STNEdge>, int) - Constructor for class it.univr.di.cstnu.algorithms.STN
- STN.CheckAlgorithm - Enum Class in it.univr.di.cstnu.algorithms
-
Implemented algorithms for STN.
- STN.STNCheckStatus - Class in it.univr.di.cstnu.algorithms
-
Represents the status of a checking algorithm during its execution and the final result of a check.
- stnCheckAlg - Variable in class it.univr.di.cstnu.visualization.TNEditor
-
Which check algorithm to use for STN
- STNCheckStatus() - Constructor for class it.univr.di.cstnu.algorithms.STN.STNCheckStatus
-
Default constructor
- STNCheckStatus(STN.STNCheckStatus) - Constructor for class it.univr.di.cstnu.algorithms.STN.STNCheckStatus
-
Copy constructor used only in benchmarks
- STNEdge - Interface in it.univr.di.cstnu.graph
-
Represents the behavior of an STN edge.
- STNEdge.EdgeValue<E> - Interface in it.univr.di.cstnu.graph
-
Functional interface to retrieve the edge value of interest.
- STNEdgeInt - Class in it.univr.di.cstnu.graph
-
Implementation of STNEdge using an integer for weight.
- STNEdgeInt() - Constructor for class it.univr.di.cstnu.graph.STNEdgeInt
-
Default constructor.
- STNEdgeInt(Edge) - Constructor for class it.univr.di.cstnu.graph.STNEdgeInt
-
Creates a new edge cloning
e
if not null. - STNEdgeInt(String) - Constructor for class it.univr.di.cstnu.graph.STNEdgeInt
- STNEdgeInt(String, int) - Constructor for class it.univr.di.cstnu.graph.STNEdgeInt
- stnStatus - Variable in class it.univr.di.cstnu.visualization.TNEditor
-
STN check status
- stnu - Variable in class it.univr.di.cstnu.visualization.TNEditor
-
STNU checker
- STNU - Class in it.univr.di.cstnu.algorithms
-
Simple class to represent and consistency-check Simple Temporal Network with Uncertainty (STNU), where the edge weights are signed integers.
- STNU - Enum constant in enum class it.univr.di.cstnu.graph.TNGraph.NetworkType
-
Simple Temporal Network with Uncertainty
- STNU() - Constructor for class it.univr.di.cstnu.algorithms.STNU
-
Default constructor.
- STNU(STNU) - Constructor for class it.univr.di.cstnu.algorithms.STNU
-
Copy constructor, used only for executing benchmarks.
- STNU(TNGraph<STNUEdge>) - Constructor for class it.univr.di.cstnu.algorithms.STNU
-
Does not make a copy of the graph!
- STNU(TNGraph<STNUEdge>, int) - Constructor for class it.univr.di.cstnu.algorithms.STNU
- STNU.ActivationDistanceInfo - Record Class in it.univr.di.cstnu.algorithms
-
4-tuple to represent the negative distance between two activation nodes and the range in which such distance can be considered.
- STNU.CheckAlgorithm - Enum Class in it.univr.di.cstnu.algorithms
-
Possible DC checking algorithm
- STNU.DistancePair - Record Class in it.univr.di.cstnu.algorithms
-
Helper record for
getPCinfo
method - STNU.EdgeData - Class in it.univr.di.cstnu.algorithms
-
Represents the immutable triple (sourceNode, weight, destinationNode) necessary for generating an STNUEdge.
- STNU.ElementStatus - Enum Class in it.univr.di.cstnu.algorithms
-
Status for 1) negative nodes in Morris 2014 algorithm or 2) contingent edges in RUL2020.
- STNU.RULGlobalInfo - Class in it.univr.di.cstnu.algorithms
-
Data structure for RUL algorithm.
- STNU.RULLocalInfo - Class in it.univr.di.cstnu.algorithms
-
Data structure for RUL algorithm.
- STNU.STNUCheckStatus - Class in it.univr.di.cstnu.algorithms
-
A simple class to represent the status of the checking algorithm during an execution.
- STNU.STNUCheckStatus.SRNCEdges - Enum Class in it.univr.di.cstnu.algorithms
-
Indicates which kind of edges determine a Semi-Reducible Negative Cycle (SRNC)
- STNU.STNUCheckStatus.SRNCInfo - Record Class in it.univr.di.cstnu.algorithms
-
Represents some statistics about a Semi-Reducible Negative Cycle (SRNC)
- STNU.STNUCheckStatus.SRNCKind - Enum Class in it.univr.di.cstnu.algorithms
-
Kinds of negative cycles
- STNU.STNUPath - Class in it.univr.di.cstnu.algorithms
-
Represents a path of the STNU edge
- stnuCheckAlg - Variable in class it.univr.di.cstnu.visualization.TNEditor
-
Which check algorithm to use for STNU
- stnuCheckAlgComboSelect - Variable in class it.univr.di.cstnu.visualization.TNEditor
-
Swing combo-select for the stnuCheckAlg.
- STNUCheckStatus() - Constructor for class it.univr.di.cstnu.algorithms.STNU.STNUCheckStatus
-
Default constructor
- STNUCheckStatus(STNU.STNUCheckStatus) - Constructor for class it.univr.di.cstnu.algorithms.STNU.STNUCheckStatus
-
Copy constructor only used in benchmarks
- STNUDensifier - Class in it.univr.di.cstnu.util
-
Reads STNU instances and makes them denser, adding up to d (n (n-1)) edges, where n is the number of nodes and d the density.
- STNUEdge - Interface in it.univr.di.cstnu.graph
-
Represents the behavior of an STNU edge.
- STNUEdge.CaseLabel - Class in it.univr.di.cstnu.graph
-
A lower/upper-case label is represented as a pair: (node-name, flag).
- STNUEdgeInt - Class in it.univr.di.cstnu.graph
-
Implements
STNUEdge
interface using signed integer values. - STNUEdgeInt() - Constructor for class it.univr.di.cstnu.graph.STNUEdgeInt
-
Constructor for STNUEdgeInt.
- STNUEdgeInt(Edge) - Constructor for class it.univr.di.cstnu.graph.STNUEdgeInt
- STNUEdgeInt(String) - Constructor for class it.univr.di.cstnu.graph.STNUEdgeInt
- STNUEdgeInt(String, int) - Constructor for class it.univr.di.cstnu.graph.STNUEdgeInt
- STNUPath() - Constructor for class it.univr.di.cstnu.algorithms.STNU.STNUPath
- STNURandomGenerator - Class in it.univr.di.cstnu.util
-
Allows one to build random STNU instances specifying: number of wanted DC/NOT DC instances And the following parameters that characterize each generated instance: number nodes, number of contingent nodes, max weight for each edge, max weight for each contingent link (upper value), max in-degree for each node, max out-degree for each node, probability to have an edge between any pair of nodes.
- STNURandomGenerator(int, int, int, int, double, int, int) - Constructor for class it.univr.di.cstnu.util.STNURandomGenerator
- STNURTE - Class in it.univr.di.cstnu.algorithms
-
A Real-Time Execution (RTE) algorithm is a scheduling algorithm that preserves maximum flexibility while requiring minimal computation.
- STNURTE(TNGraph<STNUEdge>) - Constructor for class it.univr.di.cstnu.algorithms.STNURTE
-
Default constructor.
- STNURTE(TNGraph<STNUEdge>, boolean) - Constructor for class it.univr.di.cstnu.algorithms.STNURTE
- STNURTE.ContingentLink - Record Class in it.univr.di.cstnu.algorithms
-
Represents a contingent link
- STNURTE.NodeAndExecutionTimeChoice - Interface in it.univr.di.cstnu.algorithms
-
Strategy for choosing a node and an instant among a set of possible ones.
- STNURTE.NodeEnabledInTimeInterval - Record Class in it.univr.di.cstnu.algorithms
-
Node enabled in the given time window.
- STNURTE.NodeOccurrence - Record Class in it.univr.di.cstnu.algorithms
-
Node occurrence
(t, nodes)
. - STNURTE.NodeWithTimeInterval - Record Class in it.univr.di.cstnu.algorithms
-
Node with its time window.
- STNURTE.RTED - Class in it.univr.di.cstnu.algorithms
-
RTE Decision.
- STNURTE.RTEState - Class in it.univr.di.cstnu.algorithms
-
Class to represent the data for an execution of
STNURTE.rte(Strategy, Strategy)
. - STNURTE.Strategy - Interface in it.univr.di.cstnu.algorithms
-
This interface allows the use of an enum of predefined strategies and the possibility of defining new ones.
An enum of predefined strategies allows the specification of a strategy as an input parameter. - STNURTE.StrategyEnum - Enum Class in it.univr.di.cstnu.algorithms
-
Allows the specification of a predefined strategy as an input parameter.
- STNURTEBenchmarkRunner - Class in it.univr.di.cstnu.util
-
Simple class to determine the average execution time (and standard deviation) of the RTE* STNU algorithm on a given set of STNUs.
- STNURTEBenchmarkRunner() - Constructor for class it.univr.di.cstnu.util.STNURTEBenchmarkRunner
- stnuStatus - Variable in class it.univr.di.cstnu.visualization.TNEditor
-
STNU check status
- stnuSuffix - Static variable in class it.univr.di.cstnu.util.STNURTEBenchmarkRunner
-
Suffix of STNU file
- STRAIGHT - Static variable in class it.univr.di.labeledvalue.Literal
-
Constant
STRAIGHT=''
- strictEnvironmentCheck - Variable in class it.univr.di.cstnu.algorithms.STNURTE
-
Sanity checks of the durations selected by the environment strategy.
- StrictlyPositiveIntValueRE - Static variable in class it.univr.di.labeledvalue.Constants
-
Regular expression for a positive and non-zero integer.
- subsumes(Label) - Method in class it.univr.di.labeledvalue.Label
-
A label L1 subsumes (entails) a label L2 if
L1 ⊨ L2
. - SUBTREE_DISASSEMBLY(TNGraph<E>, LabeledNode, LabeledNode, int) - Static method in class it.univr.di.cstnu.algorithms.STN
-
Subtree Disassembly strategy (Tarjan, 1981).
- sumWithOverflowCheck(int, int) - Static method in class it.univr.di.labeledvalue.Constants
-
Determines the sum of
a
andb
.
T
- takeFrom(TNGraph<? extends E>) - Method in class it.univr.di.cstnu.graph.TNGraph
-
Takes from g1 all its internal structures.
- takeFrom(TNGraph<? extends K>) - Method in class it.univr.di.cstnu.graph.TNGraph.UnmodifiableTNGraph
-
Unsupported.
- takeIn(AbstractCSTN.EdgesToCheck<E>) - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN.EdgesToCheck
-
Copy the fields reference into this.
- takeIn(Component) - Method in class it.univr.di.cstnu.graph.AbstractComponent
- takeIn(Edge) - Method in class it.univr.di.cstnu.graph.AbstractEdge
- takeIn(Edge) - Method in class it.univr.di.cstnu.graph.BasicCSTNUEdgePluggable
- takeIn(Edge) - Method in class it.univr.di.cstnu.graph.CSTNEdgePluggable
- takeIn(Edge) - Method in class it.univr.di.cstnu.graph.CSTNPSUEdgePluggable
- takeIn(Edge) - Method in class it.univr.di.cstnu.graph.CSTNUEdgePluggable
- takeIn(Edge) - Method in interface it.univr.di.cstnu.graph.Edge
-
A copy by reference of the internal structure of edge e.
- takeIn(Edge) - Method in class it.univr.di.cstnu.graph.STNEdgeInt
- takeIn(Edge) - Method in class it.univr.di.cstnu.graph.STNUEdgeInt
- takeIn(Node) - Method in class it.univr.di.cstnu.graph.AbstractNode
- takeIn(Node) - Method in interface it.univr.di.cstnu.graph.Node
-
A copy by reference of node 'e' internal structure.
- timeInterval() - Method in record class it.univr.di.cstnu.algorithms.STNURTE.NodeEnabledInTimeInterval
-
Returns the value of the
timeInterval
record component. - timeInterval() - Method in record class it.univr.di.cstnu.algorithms.STNURTE.NodeWithTimeInterval
-
Returns the value of the
timeInterval
record component. - TimeInterval - Class in it.univr.di.cstnu.util
-
Represents a time interval where the lower bound is guaranteed to be ≤ the upper bound.
- TimeInterval(int) - Constructor for class it.univr.di.cstnu.util.TimeInterval
-
Fix the lower bound to 'l' and the upper bound to '+∞'.
- TimeInterval(int, int) - Constructor for class it.univr.di.cstnu.util.TimeInterval
- TimeInterval(TimeInterval) - Constructor for class it.univr.di.cstnu.util.TimeInterval
-
Constructor by copy
- timeout - Variable in class it.univr.di.cstnu.algorithms.STN.STNCheckStatus
-
Becomes true if the check has been interrupted because a given time-out has occurred.
- timeOut - Variable in class it.univr.di.cstnu.algorithms.AbstractCSTN
-
Timeout in seconds for the check.
- timeOut - Variable in class it.univr.di.cstnu.algorithms.STN
-
Timeout in seconds for the check.
- TNEditor - Class in it.univr.di.cstnu.visualization
-
A simple graphical application for creating/loading/modifying/saving/checking CSTNs.
- TNEditor() - Constructor for class it.univr.di.cstnu.visualization.TNEditor
-
Initializes the fundamental fields.
- tnGraph - Variable in class it.univr.di.cstnu.visualization.ObservableValidator
- TNGraph<E> - Class in it.univr.di.cstnu.graph
-
Represents (dense) temporal network graphs where nodes are
LabeledNode
and edges are (an extension of)Edge
. - TNGraph(TNGraph<E>, Class<E1>) - Constructor for class it.univr.di.cstnu.graph.TNGraph
-
A constructor that copies a given graph g using the copy constructor for internal structures.
If g is null, this new graph will be empty. - TNGraph(TNGraph<E>, Class<E1>, boolean, boolean) - Constructor for class it.univr.di.cstnu.graph.TNGraph
-
A constructor that copies a given graph g using the copy constructor for internal structures.
If g is null, this new graph will be empty. - TNGraph(String, Class<E1>) - Constructor for class it.univr.di.cstnu.graph.TNGraph
-
Constructor for TNGraph.
- TNGraph(String, Class<E1>, ALabelAlphabet) - Constructor for class it.univr.di.cstnu.graph.TNGraph
-
Constructor for TNGraph.
- TNGraph.NetworkType - Enum Class in it.univr.di.cstnu.graph
-
Types of networks that this class can represent.
- TNGraph.UnmodifiableTNGraph<K> - Class in it.univr.di.cstnu.graph
-
Unmodifiable version of this graph.
- TNGraphMLReader<E> - Class in it.univr.di.cstnu.graph
-
Allows the reading of a Temporal Network (TM) graph from a file or a string in GraphML format.
- TNGraphMLReader() - Constructor for class it.univr.di.cstnu.graph.TNGraphMLReader
-
A TNGraphMLReader object can now be used many times to read different graphs.
- TNGraphMLWriter - Class in it.univr.di.cstnu.graph
-
Allows the writing of a Temporal Network graph to a file or a string in GraphML format.
- TNGraphMLWriter(AbstractLayout<LabeledNode, ? extends Edge>) - Constructor for class it.univr.di.cstnu.graph.TNGraphMLWriter
-
Constructor for TNGraphMLWriter.
- TNPredecessorGraph<E> - Class in it.univr.di.cstnu.graph
-
Optimized representation of immutable predecessor graphs.
- TNPredecessorGraph() - Constructor for class it.univr.di.cstnu.graph.TNPredecessorGraph
-
Default constructor
- toArray() - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN.NodesToCheck
- toArray() - Method in class it.univr.di.cstnu.util.ObjectArrayFIFOSetQueue
- toArray() - Method in class it.univr.di.cstnu.util.ObjectPair
- toArray(S[]) - Method in class it.univr.di.cstnu.util.ObjectPair
- toArray(T[]) - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN.NodesToCheck
- toArray(T[]) - Method in class it.univr.di.cstnu.util.ObjectArrayFIFOSetQueue
- toChars(int, char) - Static method in class it.univr.di.labeledvalue.Literal
- toLogicalExpr(boolean, String, String, String) - Method in class it.univr.di.labeledvalue.Label
-
Return a string representing the label as a logical expression using logical 'not', 'and', and 'or'.
- toLowerCase() - Method in class it.univr.di.labeledvalue.ALabel
- toString() - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN.CSTNCheckStatus
- toString() - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN.NodesToCheck
- toString() - Method in class it.univr.di.cstnu.algorithms.CSTNPSU.PrototypalLink
- toString() - Method in class it.univr.di.cstnu.algorithms.CSTNU.CSTNUCheckStatus
- toString() - Method in class it.univr.di.cstnu.algorithms.OSTNU.OSTNUCheckStatus
- toString() - Method in class it.univr.di.cstnu.algorithms.PSTN.PSTNCheckStatus
- toString() - Method in class it.univr.di.cstnu.algorithms.STN.STNCheckStatus
- toString() - Method in record class it.univr.di.cstnu.algorithms.STNU.ActivationDistanceInfo
-
Returns a string representation of this record class.
- toString() - Method in record class it.univr.di.cstnu.algorithms.STNU.DistancePair
-
Returns a string representation of this record class.
- toString() - Method in record class it.univr.di.cstnu.algorithms.STNU.STNUCheckStatus.SRNCInfo
-
Returns a string representation of this record class.
- toString() - Method in class it.univr.di.cstnu.algorithms.STNU.STNUCheckStatus
- toString() - Method in class it.univr.di.cstnu.algorithms.STNU.STNUPath
- toString() - Method in record class it.univr.di.cstnu.algorithms.STNURTE.ContingentLink
-
Returns a string representation of this record class.
- toString() - Method in record class it.univr.di.cstnu.algorithms.STNURTE.NodeEnabledInTimeInterval
-
Returns a string representation of this record class.
- toString() - Method in record class it.univr.di.cstnu.algorithms.STNURTE.NodeOccurrence
-
Returns a string representation of this record class.
- toString() - Method in record class it.univr.di.cstnu.algorithms.STNURTE.NodeWithTimeInterval
-
Returns a string representation of this record class.
- toString() - Method in class it.univr.di.cstnu.algorithms.STNURTE.RTED
- toString() - Method in class it.univr.di.cstnu.algorithms.STNURTE.RTEState
- toString() - Method in class it.univr.di.cstnu.graph.AbstractComponent
-
Return a string representation of labeled values.
- toString() - Method in class it.univr.di.cstnu.graph.BasicCSTNUEdgePluggable.InternalEntry
- toString() - Method in class it.univr.di.cstnu.graph.BasicCSTNUEdgePluggable
-
Return a string representation of labeled values.h
- toString() - Method in interface it.univr.di.cstnu.graph.Component
-
Return a string representation of labeled values.
- toString() - Method in class it.univr.di.cstnu.graph.CSTNEdgePluggable
- toString() - Method in class it.univr.di.cstnu.graph.EdgeSupplier
- toString() - Method in class it.univr.di.cstnu.graph.LabeledNode
- toString() - Method in class it.univr.di.cstnu.graph.STNEdgeInt
- toString() - Method in class it.univr.di.cstnu.graph.STNUEdge.CaseLabel
- toString() - Method in class it.univr.di.cstnu.graph.STNUEdgeInt
- toString() - Method in class it.univr.di.cstnu.graph.TNGraph
- toString() - Method in class it.univr.di.cstnu.graph.TNPredecessorGraph
-
A simple string representation.
- toString() - Method in class it.univr.di.cstnu.util.ActiveWaits
- toString() - Method in class it.univr.di.cstnu.util.ExtendedPriorityQueue
- toString() - Method in class it.univr.di.cstnu.util.GraphDistancesImpl
- toString() - Method in class it.univr.di.cstnu.util.LogNormalDistributionParameter
- toString() - Method in class it.univr.di.cstnu.util.ObjectArrayFIFOSetQueue
- toString() - Method in class it.univr.di.cstnu.util.ObjectPair
- toString() - Method in record class it.univr.di.cstnu.util.OptimizationEngine.OptimizationResult
-
Returns a string representation of this record class.
- toString() - Method in record class it.univr.di.cstnu.util.PSTNRTEBenchmarkRunner.PSTNSituation
-
Returns a string representation of this record class.
- toString() - Method in class it.univr.di.cstnu.util.TimeInterval
- toString() - Method in class it.univr.di.cstnu.visualization.CSTNLayout
- toString() - Method in class it.univr.di.cstnu.visualization.CSTNUStaticLayout
- toString() - Method in class it.univr.di.labeledvalue.AbstractLabeledIntMap
- toString() - Method in class it.univr.di.labeledvalue.ALabel.EmptyLabel
- toString() - Method in enum class it.univr.di.labeledvalue.ALabel.State
- toString() - Method in class it.univr.di.labeledvalue.ALabel
- toString() - Method in class it.univr.di.labeledvalue.ALabelAlphabet.ALetter
- toString() - Method in class it.univr.di.labeledvalue.ALabelAlphabet
- toString() - Method in class it.univr.di.labeledvalue.Label
- toString() - Method in class it.univr.di.labeledvalue.LabeledALabelIntTreeMap
-
Returns a string representing the content of the map, i.e., "{[⟨entry⟩ ]*}", where each ⟨entry⟩ is written by
LabeledALabelIntTreeMap.entryAsString(Label, int, ALabel)
. - toString() - Method in class it.univr.di.labeledvalue.LabeledIntHierarchyMap.HierarchyNode
- toString() - Method in class it.univr.di.labeledvalue.LabeledIntMapSupplier
- toString() - Method in class it.univr.di.labeledvalue.LabeledLowerCaseValue
- toString() - Method in class it.univr.di.labeledvalue.Literal
- toString(boolean) - Method in class it.univr.di.labeledvalue.LabeledLowerCaseValue
- total - Variable in class it.univr.di.cstnu.util.RunMeter
- toUpperCase() - Method in class it.univr.di.labeledvalue.ALabel
- transform() - Method in class it.univr.di.cstnu.algorithms.CSTN2CSTN0
-
Returns the corresponding CSTN having each observation node 'P?'
- transform() - Method in class it.univr.di.cstnu.algorithms.CSTNU2CSTN
-
Returns the corresponding CSTN of the given CSTNU g.
- translate() - Method in class it.univr.di.cstnu.util.CSTNU2UppaalTiga
-
Convert a CSTNU TNGraph g into a Timed Game Automata in the UPPAAL TIGA format.
- transpose() - Method in class it.univr.di.cstnu.graph.TNGraph
-
Transposes
this
, inverting only the source/destination of each edge. - transpose() - Method in class it.univr.di.cstnu.graph.TNGraph.UnmodifiableTNGraph
-
Unsupported.
- trim() - Method in class it.univr.di.cstnu.util.ObjectArrayFIFOSetQueue
-
Trims the queue to the smallest possible size.
U
- UC_LABEL - Static variable in interface it.univr.di.cstnu.graph.STNUEdge
-
Constant
UC_LABEL="UC"
- UNKNOWN - Static variable in class it.univr.di.labeledvalue.Constants
-
Char representing the logic 'not know' symbol: ¿.
- UNKNOWN - Static variable in class it.univr.di.labeledvalue.Literal
-
Constant
UNKNOWN=Constants.UNKNOWN
- UNKNOWNstring - Static variable in class it.univr.di.labeledvalue.Constants
- unmodifiable() - Method in class it.univr.di.labeledvalue.LabeledALabelIntTreeMap
- unmodifiable() - Method in class it.univr.di.labeledvalue.LabeledIntHierarchyMap
- unmodifiable() - Method in interface it.univr.di.labeledvalue.LabeledIntMap
- unmodifiable() - Method in class it.univr.di.labeledvalue.LabeledIntSimpleMap
-
Deprecated.
- unmodifiable() - Method in class it.univr.di.labeledvalue.LabeledIntTreeMap
- unmodifiable(TNGraph<K>) - Static method in class it.univr.di.cstnu.graph.TNGraph
-
Returns an unmodifiable TNGraph backed by the given TNGraph.
- unmodifiable(ALabel) - Method in class it.univr.di.labeledvalue.LabeledALabelIntTreeMap
- UnmodifiableTNGraph(TNGraph<K>) - Constructor for class it.univr.di.cstnu.graph.TNGraph.UnmodifiableTNGraph
-
Default constructor
- UNREACHED - Enum constant in enum class it.univr.di.cstnu.graph.LabeledNode.Status
- unStarted - Enum constant in enum class it.univr.di.cstnu.algorithms.STNU.ElementStatus
-
unstarted MUST be the first element of this enum!
- unStartedUCEdges - Variable in class it.univr.di.cstnu.algorithms.STNU.RULLocalInfo
-
Edges to check
- UPDATE_DISTANCES(GraphDistances, Object2IntMap<LabeledNode>, LabeledNode) - Static method in interface it.univr.di.cstnu.util.GraphAlgs
-
Updates the 'apap' graph distances and the `nodePotential` propagating the assumed updated outgoing edges from node `A`.
- updateContingentBounds(STNU) - Method in class it.univr.di.cstnu.algorithms.PSTN
-
A PSTN maintains bounds of a contingent link as a lower / upper case-edge value.
- updateCount - Variable in class it.univr.di.labeledvalue.LabeledIntSimpleMap
-
Deprecated.Counter of labeled value updates.
- updateLowerBound(LabeledNode, int) - Method in class it.univr.di.cstnu.algorithms.STNURTE.RTEState
-
Updates the lower bound of the time window of the given node to a lower value.
- updateNodePositions() - Method in class it.univr.di.cstnu.visualization.TNEditor
-
Update node positions in the derived graph.
- updatePotentialCount(LabeledNode, Label, boolean) - Static method in class it.univr.di.cstnu.algorithms.CSTNPotential
-
Updates the count associated with the pair (node, label), adding 1 unless reset is true.
- updateUpperBound(LabeledNode, int) - Method in class it.univr.di.cstnu.algorithms.STNURTE.RTEState
-
Updates the upper bound of the time window of the given node to upper.
- updateValue(int) - Method in interface it.univr.di.cstnu.graph.STNEdge
-
Sets the ordinary value if v is smaller than the current one.
- updateValue(int) - Method in class it.univr.di.cstnu.graph.STNEdgeInt
-
Sets the ordinary value if v is smaller than the current one.
- updateValue(int) - Method in class it.univr.di.cstnu.graph.STNUEdgeInt
-
If the edge is not a wait, it sets the ordinary value if v is smaller than the current one.
- updatevvViewer() - Method in class it.univr.di.cstnu.visualization.TNEditor
-
Update the vvViewer after a check, making some common operations.
- updateWait(int, ALabelAlphabet.ALetter) - Method in interface it.univr.di.cstnu.graph.STNUEdge
-
If the edge is a wait, it sets the wait value if v is smaller than the current wait value.
- upperBound() - Method in record class it.univr.di.cstnu.algorithms.STNU.ActivationDistanceInfo
-
Returns the value of the
upperBound
record component. - upperBound() - Method in record class it.univr.di.cstnu.algorithms.STNURTE.ContingentLink
-
Returns the value of the
upperBound
record component. - upperCaseCount() - Method in record class it.univr.di.cstnu.algorithms.STNU.STNUCheckStatus.SRNCInfo
-
Returns the value of the
upperCaseCount
record component. - upperCaseEdgeFromActivation - Variable in class it.univr.di.cstnu.algorithms.STNU.RULGlobalInfo
-
upperCaseEdgeFromActivation for rul2020OneStepBackProp
- upperCaseEdgeStatus - Variable in class it.univr.di.cstnu.algorithms.STNU.RULGlobalInfo
-
Status of each upperCase edge
- upperCaseRuleCalls - Variable in class it.univr.di.cstnu.algorithms.OSTNU.OSTNUCheckStatus
-
Counts the # of applications of different rules.
- upperCaseValue - Variable in class it.univr.di.cstnu.graph.BasicCSTNUEdgePluggable
-
Morris Upper case value augmented by a propositional label.
- upperCaseValueAsString(ALabel, int, Label) - Static method in class it.univr.di.cstnu.algorithms.CSTNU
- upperCaseValueAsString(ALabel, int, Label) - Static method in class it.univr.di.cstnu.algorithms.OSTNU
- upperCaseValueAsString(ALabel, int, Label) - Static method in class it.univr.di.cstnu.graph.BasicCSTNUEdgePluggable
- upperCaseValuesAsString() - Method in interface it.univr.di.cstnu.graph.BasicCSTNUEdge
- upperCaseValuesAsString() - Method in class it.univr.di.cstnu.graph.BasicCSTNUEdgePluggable
- upperCaseValueSize() - Method in interface it.univr.di.cstnu.graph.BasicCSTNUEdge
- upperCaseValueSize() - Method in class it.univr.di.cstnu.graph.BasicCSTNUEdgePluggable
- upperPotentialR3(AbstractCSTN.NodesToCheck, AbstractCSTN.NodesToCheck, Instant) - Method in class it.univr.di.cstnu.algorithms.CSTNPotential
-
Apply R3 to the upper potential of each node in nodesToCheck.
- userWantsToStayWithCurrentNetworkInEditor() - Method in class it.univr.di.cstnu.visualization.TNEditor
-
Shows a ConfirmDialog to ask the user if they want to stay or not with the current input network.
V
- validate(Problems, String, String) - Method in class it.univr.di.cstnu.visualization.ObservableValidator
- validationPanelCSTN - Variable in class it.univr.di.cstnu.visualization.TNEditor
-
Validation panel for CSTN row
- validationPanelCSTNPSU - Variable in class it.univr.di.cstnu.visualization.TNEditor
-
Validation panel for CSTNPSU row
- validationPanelCSTNU - Variable in class it.univr.di.cstnu.visualization.TNEditor
-
Validation panel for CSTNU row
- value - Variable in class it.univr.di.cstnu.graph.STNEdgeInt
-
the value associated with the edge
- value - Variable in class it.univr.di.labeledvalue.LabeledIntHierarchyMap.HierarchyNode
- value() - Method in record class it.univr.di.cstnu.algorithms.STNU.STNUCheckStatus.SRNCInfo
-
Returns the value of the
value
record component. - value() - Method in class it.univr.di.cstnu.algorithms.STNU.STNUPath
- valueOf(char) - Static method in class it.univr.di.labeledvalue.Literal
-
Returns the positive literal of
v
. - valueOf(char, char) - Static method in class it.univr.di.labeledvalue.Label
- valueOf(char, char) - Static method in class it.univr.di.labeledvalue.Literal
-
Return the literal having the given
state
ofv
. - valueOf(Literal, char) - Static method in class it.univr.di.labeledvalue.Literal
-
Returns a new literal having same proposition of
v
but with state given bystate
. - valueOf(String) - Static method in enum class it.univr.di.cstnu.algorithms.AbstractCSTN.CheckAlgorithm
-
Returns the enum constant of this class with the specified name.
- valueOf(String) - Static method in enum class it.univr.di.cstnu.algorithms.AbstractCSTN.DCSemantics
-
Returns the enum constant of this class with the specified name.
- valueOf(String) - Static method in enum class it.univr.di.cstnu.algorithms.STN.CheckAlgorithm
-
Returns the enum constant of this class with the specified name.
- valueOf(String) - Static method in enum class it.univr.di.cstnu.algorithms.STNU.CheckAlgorithm
-
Returns the enum constant of this class with the specified name.
- valueOf(String) - Static method in enum class it.univr.di.cstnu.algorithms.STNU.ElementStatus
-
Returns the enum constant of this class with the specified name.
- valueOf(String) - Static method in enum class it.univr.di.cstnu.algorithms.STNU.STNUCheckStatus.SRNCEdges
-
Returns the enum constant of this class with the specified name.
- valueOf(String) - Static method in enum class it.univr.di.cstnu.algorithms.STNU.STNUCheckStatus.SRNCKind
-
Returns the enum constant of this class with the specified name.
- valueOf(String) - Static method in enum class it.univr.di.cstnu.algorithms.STNURTE.StrategyEnum
-
Returns the enum constant of this class with the specified name.
- valueOf(String) - Static method in enum class it.univr.di.cstnu.algorithms.WellDefinitionException.Type
-
Returns the enum constant of this class with the specified name.
- valueOf(String) - Static method in enum class it.univr.di.cstnu.graph.Edge.ConstraintType
-
Returns the enum constant of this class with the specified name.
- valueOf(String) - Static method in enum class it.univr.di.cstnu.graph.LabeledNode.Status
-
Returns the enum constant of this class with the specified name.
- valueOf(String) - Static method in enum class it.univr.di.cstnu.graph.TNGraph.NetworkType
-
Returns the enum constant of this class with the specified name.
- valueOf(String) - Static method in enum class it.univr.di.cstnu.util.ExtendedPriorityQueue.Status
-
Returns the enum constant of this class with the specified name.
- valueOf(String) - Static method in enum class it.univr.di.cstnu.util.PSTNRTEBenchmarkRunner.ExitExecution
-
Returns the enum constant of this class with the specified name.
- valueOf(String) - Static method in enum class it.univr.di.cstnu.visualization.EdgeRendering
-
Returns the enum constant of this class with the specified name.
- valueOf(String) - Static method in enum class it.univr.di.cstnu.visualization.NodeRendering
-
Returns the enum constant of this class with the specified name.
- valueOf(String) - Static method in enum class it.univr.di.Debug
-
Returns the enum constant of this class with the specified name.
- valueOf(String) - Static method in enum class it.univr.di.labeledvalue.ALabel.State
-
Returns the enum constant of this class with the specified name.
- valueRE - Static variable in class it.univr.di.labeledvalue.AbstractLabeledIntMap
-
Admissible values as a regular expression.
- valueREPattern - Static variable in class it.univr.di.labeledvalue.AbstractLabeledIntMap
-
Pattern of valueREString
- values() - Static method in enum class it.univr.di.cstnu.algorithms.AbstractCSTN.CheckAlgorithm
-
Returns an array containing the constants of this enum class, in the order they are declared.
- values() - Static method in enum class it.univr.di.cstnu.algorithms.AbstractCSTN.DCSemantics
-
Returns an array containing the constants of this enum class, in the order they are declared.
- values() - Static method in enum class it.univr.di.cstnu.algorithms.STN.CheckAlgorithm
-
Returns an array containing the constants of this enum class, in the order they are declared.
- values() - Static method in enum class it.univr.di.cstnu.algorithms.STNU.CheckAlgorithm
-
Returns an array containing the constants of this enum class, in the order they are declared.
- values() - Static method in enum class it.univr.di.cstnu.algorithms.STNU.ElementStatus
-
Returns an array containing the constants of this enum class, in the order they are declared.
- values() - Static method in enum class it.univr.di.cstnu.algorithms.STNU.STNUCheckStatus.SRNCEdges
-
Returns an array containing the constants of this enum class, in the order they are declared.
- values() - Static method in enum class it.univr.di.cstnu.algorithms.STNU.STNUCheckStatus.SRNCKind
-
Returns an array containing the constants of this enum class, in the order they are declared.
- values() - Static method in enum class it.univr.di.cstnu.algorithms.STNURTE.StrategyEnum
-
Returns an array containing the constants of this enum class, in the order they are declared.
- values() - Static method in enum class it.univr.di.cstnu.algorithms.WellDefinitionException.Type
-
Returns an array containing the constants of this enum class, in the order they are declared.
- values() - Static method in enum class it.univr.di.cstnu.graph.Edge.ConstraintType
-
Returns an array containing the constants of this enum class, in the order they are declared.
- values() - Static method in enum class it.univr.di.cstnu.graph.LabeledNode.Status
-
Returns an array containing the constants of this enum class, in the order they are declared.
- values() - Static method in enum class it.univr.di.cstnu.graph.TNGraph.NetworkType
-
Returns an array containing the constants of this enum class, in the order they are declared.
- values() - Static method in enum class it.univr.di.cstnu.util.ExtendedPriorityQueue.Status
-
Returns an array containing the constants of this enum class, in the order they are declared.
- values() - Static method in enum class it.univr.di.cstnu.util.PSTNRTEBenchmarkRunner.ExitExecution
-
Returns an array containing the constants of this enum class, in the order they are declared.
- values() - Static method in enum class it.univr.di.cstnu.visualization.EdgeRendering
-
Returns an array containing the constants of this enum class, in the order they are declared.
- values() - Static method in enum class it.univr.di.cstnu.visualization.NodeRendering
-
Returns an array containing the constants of this enum class, in the order they are declared.
- values() - Static method in enum class it.univr.di.Debug
-
Returns an array containing the constants of this enum class, in the order they are declared.
- values() - Static method in enum class it.univr.di.labeledvalue.ALabel.State
-
Returns an array containing the constants of this enum class, in the order they are declared.
- values() - Method in class it.univr.di.labeledvalue.LabeledIntHierarchyMap
- values() - Method in interface it.univr.di.labeledvalue.LabeledIntMap
- values() - Method in class it.univr.di.labeledvalue.LabeledIntSimpleMap
-
Deprecated.
- values() - Method in class it.univr.di.labeledvalue.LabeledIntTreeMap
- VERSIONandDATE - Static variable in class it.univr.di.cstnu.algorithms.AbstractCSTN
-
Version of the class
- VERSIONandDATE - Static variable in class it.univr.di.cstnu.algorithms.CSTN
-
Version of the class
- VERSIONandDATE - Static variable in class it.univr.di.cstnu.algorithms.CSTN2CSTN0
-
Version of the class
- VERSIONandDATE - Static variable in class it.univr.di.cstnu.algorithms.CSTNEpsilon
-
Version of the class
- VERSIONandDATE - Static variable in class it.univr.di.cstnu.algorithms.CSTNEpsilon3R
-
Version of the class
- VERSIONandDATE - Static variable in class it.univr.di.cstnu.algorithms.CSTNEpsilon3RwoNodeLabels
-
Version of the class
- VERSIONandDATE - Static variable in class it.univr.di.cstnu.algorithms.CSTNEpsilonwoNodeLabels
-
Version of the class
- VERSIONandDATE - Static variable in class it.univr.di.cstnu.algorithms.CSTNIR
-
Version of the class
- VERSIONandDATE - Static variable in class it.univr.di.cstnu.algorithms.CSTNIR3R
-
Version of the class
- VERSIONandDATE - Static variable in class it.univr.di.cstnu.algorithms.CSTNIR3RwoNodeLabels
-
Version of the class
- VERSIONandDATE - Static variable in class it.univr.di.cstnu.algorithms.CSTNIRwoNodeLabels
-
Version of the class
- VERSIONandDATE - Static variable in class it.univr.di.cstnu.algorithms.CSTNPotential
-
Version of the class
- VERSIONandDATE - Static variable in class it.univr.di.cstnu.algorithms.CSTNPSU
-
Version of the class
- VERSIONandDATE - Static variable in class it.univr.di.cstnu.algorithms.CSTNU
-
Version of the class
- VERSIONandDATE - Static variable in class it.univr.di.cstnu.algorithms.CSTNU2CSTN
-
Version of the class
- VERSIONandDATE - Static variable in class it.univr.di.cstnu.algorithms.CSTNwoNodeLabel
-
Version of the class
- VERSIONandDATE - Static variable in class it.univr.di.cstnu.algorithms.OSTNU
-
Version of the class
- VERSIONandDATE - Static variable in class it.univr.di.cstnu.algorithms.PCSTNU
-
Version of the class
- VERSIONandDATE - Static variable in class it.univr.di.cstnu.algorithms.PSTN
-
Version of the class
- VERSIONandDATE - Static variable in class it.univr.di.cstnu.algorithms.STN
-
Version of the class
- VERSIONandDATE - Static variable in class it.univr.di.cstnu.algorithms.STNU
-
Version of the class
- VERSIONandDATE - Static variable in class it.univr.di.cstnu.algorithms.STNURTE
-
Version of the class.
- VERSIONandDATE - Static variable in class it.univr.di.cstnu.util.Checker
-
Version
- VERSIONandDATE - Static variable in class it.univr.di.cstnu.util.CSTNRandomGenerator
-
Version of the class
- VERSIONandDATE - Static variable in class it.univr.di.cstnu.util.CSTNU2CSTNPSU
-
Version of the class
- VERSIONandDATE - Static variable in class it.univr.di.cstnu.util.CSTNU2UppaalTiga
-
Gives the version of the file
- VERSIONandDATE - Static variable in class it.univr.di.cstnu.util.DispatchabilityBenchmarkRunner
-
Version
- VERSIONandDATE - Static variable in class it.univr.di.cstnu.util.GraphML2Luke
-
Version
- VERSIONandDATE - Static variable in class it.univr.di.cstnu.util.Luke2GraphML
-
Version
- VERSIONandDATE - Static variable in class it.univr.di.cstnu.util.OSTNURandomGenerator
-
Version of the class
- VERSIONandDATE - Static variable in class it.univr.di.cstnu.util.PSTNRTEBenchmarkRunner
-
Version
- VERSIONandDATE - Static variable in class it.univr.di.cstnu.util.SRNCFinderBenchmarkRunner
-
Version
- VERSIONandDATE - Static variable in class it.univr.di.cstnu.util.STNUDensifier
-
Version of the class
- VERSIONandDATE - Static variable in class it.univr.di.cstnu.util.STNURandomGenerator
-
Version of the class
- VERSIONandDATE - Static variable in class it.univr.di.cstnu.util.STNURTEBenchmarkRunner
-
Version
- VERSIONandDATE - Static variable in class it.univr.di.cstnu.visualization.CSTNLayout
-
Version
- VERSIONandDATE - Static variable in class it.univr.di.cstnu.visualization.CSTNUStaticLayout
-
Version
- VERSIONandDATE - Static variable in class it.univr.di.cstnu.visualization.ObservableValidator
-
Version
- versionReq - Variable in class it.univr.di.cstnu.algorithms.AbstractCSTN
-
Software Version.
- versionReq - Variable in class it.univr.di.cstnu.algorithms.STN
-
Software Version.
- vertexFactory - Variable in class it.univr.di.cstnu.visualization.EditingModalGraphMouse
- vertexFactory - Variable in class it.univr.di.cstnu.visualization.EditingPopupGraphMousePlugin
- vertexLabelFunction - Static variable in enum class it.univr.di.cstnu.visualization.NodeRendering
-
Used to show the node name.
- vertexSupport - Variable in class it.univr.di.cstnu.visualization.EditingGraphMousePlugin
-
Helper for creating a node
- vertexToolTipFunction - Static variable in enum class it.univr.di.cstnu.visualization.NodeRendering
-
Transformer object to show the tooltip of the node: the label is printed.
- viewerMessageArea - Variable in class it.univr.di.cstnu.visualization.TNEditor
-
Message area above the derived (no input) graph.
- visit - Variable in class it.univr.di.labeledvalue.LabeledIntHierarchyMap.HierarchyNode
-
To manage the visit
- vvEditor - Variable in class it.univr.di.cstnu.visualization.TNEditor
-
The BasicVisualizationServer<V, E> for input graph.
- vvViewer - Variable in class it.univr.di.cstnu.visualization.TNEditor
-
The BasicVisualizationServer<V, E> for derived graph.
W
- WARN_ICON_FILE - Static variable in class it.univr.di.cstnu.visualization.TNEditor
- wasPresent - Enum constant in enum class it.univr.di.cstnu.util.ExtendedPriorityQueue.Status
-
The element has been added and removed from this queue.
- weight - Variable in class it.univr.di.cstnu.algorithms.STNU.EdgeData
- WEIGHT - Static variable in class it.univr.di.cstnu.util.STNUDensifier
-
Weight for a redundant edge.
- WEIGHT_MODIFICATION_FACTOR - Static variable in class it.univr.di.cstnu.util.CSTNRandomGenerator
-
Default factor for modifying an edge
- WEIGHT_MODIFICATION_FACTOR - Static variable in class it.univr.di.cstnu.util.OSTNURandomGenerator
-
Default factor for modifying an edge
- WEIGHT_MODIFICATION_FACTOR - Static variable in class it.univr.di.cstnu.util.STNURandomGenerator
-
Default factor for modifying an edge
- WellDefinitionException - Exception Class in it.univr.di.cstnu.algorithms
-
Some common types of unsatisfied property for well-defined CSTN.
- WellDefinitionException() - Constructor for exception class it.univr.di.cstnu.algorithms.WellDefinitionException
- WellDefinitionException(String) - Constructor for exception class it.univr.di.cstnu.algorithms.WellDefinitionException
- WellDefinitionException(String, WellDefinitionException.Type) - Constructor for exception class it.univr.di.cstnu.algorithms.WellDefinitionException
- WellDefinitionException(String, Throwable) - Constructor for exception class it.univr.di.cstnu.algorithms.WellDefinitionException
- WellDefinitionException(String, Throwable, boolean, boolean) - Constructor for exception class it.univr.di.cstnu.algorithms.WellDefinitionException
- WellDefinitionException(Throwable) - Constructor for exception class it.univr.di.cstnu.algorithms.WellDefinitionException
- WellDefinitionException.Type - Enum Class in it.univr.di.cstnu.algorithms
-
Kinds of possible errors in checking well-definition property.
- wellFormatCheck - Variable in class it.univr.di.labeledvalue.LabeledIntHierarchyMap
-
Just to force the control that, after each put, the format of hierarchy is still valid.
- withNodeLabels - Variable in class it.univr.di.cstnu.algorithms.AbstractCSTN
-
If false, node labels are ignored during the check.
X
- X_SHIFT - Static variable in class it.univr.di.cstnu.util.OSTNURandomGenerator
-
Default x shift for node position
- X_SHIFT - Static variable in class it.univr.di.cstnu.util.STNURandomGenerator
-
Default x shift for node position
Y
- Y_SHIFT - Static variable in class it.univr.di.cstnu.util.OSTNURandomGenerator
-
Default y shift for node position
- Y_SHIFT - Static variable in class it.univr.di.cstnu.util.STNURandomGenerator
-
Default y shift for node position
- Yen - Enum constant in enum class it.univr.di.cstnu.algorithms.STN.CheckAlgorithm
-
Yen
- YEN_ALGORITHM(TNGraph<E>, boolean, boolean, int, STN.STNCheckStatus) - Static method in class it.univr.di.cstnu.algorithms.STN
-
Algorithm 4: Yen's algorithm (adaptive version with early termination)
- YenSingleSink - Enum constant in enum class it.univr.di.cstnu.algorithms.STN.CheckAlgorithm
-
Yen
Z
- ZERO_NODE_NAME - Static variable in class it.univr.di.cstnu.algorithms.AbstractCSTN
-
The name for the initial node.
- ZERO_NODE_NAME - Static variable in class it.univr.di.cstnu.algorithms.PSTN
-
The name for the initial node.
- ZERO_NODE_NAME - Static variable in class it.univr.di.cstnu.algorithms.STN
-
The name for the initial node.
- ZERO_NODE_NAME - Static variable in class it.univr.di.cstnu.algorithms.STNU
-
The name for the initial node.
- zExclamationRuleCalls - Variable in class it.univr.di.cstnu.algorithms.CSTNU.CSTNUCheckStatus
-
Counts the # of applications of different rules.
- zLabeledLetterRemovalRule(LabeledNode, CSTNUEdge) - Method in class it.univr.di.cstnu.algorithms.CSTNU
-
Labeled LetterRemoval (zLr) and (zLr*)
Ε
- ε - Enum constant in enum class it.univr.di.cstnu.algorithms.AbstractCSTN.DCSemantics
-
ε-reaction semantics
All Classes and Interfaces|All Packages|Constant Field Values|Serialized Form