Dijkstra.Full (MultiLayerAlignment)

java.lang.Object
- org.processmining.multilayeralignment.algorithms.implementations.Dijkstra
- - org.processmining.multilayeralignment.algorithms.implementations.Dijkstra.Full

All Implemented Interfaces:

ReplayAlgorithm

Enclosing class:

Dijkstra
```
public static class Dijkstra.Full
extends Dijkstra
```
Special version of Dijkstra that builds the entire search space, i.e. this version never terminates correctly, but the search simply stops when the queueis empty.

Author:

bfvdonge

Nested Class Summary
- Nested classes/interfaces inherited from class org.processmining.multilayeralignment.algorithms.implementations.Dijkstra
  Dijkstra.Full
- Nested classes/interfaces inherited from interface org.processmining.multilayeralignment.algorithms.ReplayAlgorithm
  ReplayAlgorithm.CloseResult, ReplayAlgorithm.Debug

Field Summary

Fields
Modifier and Type	Field and Description
`protected int`	`alignmentCost`
`protected int`	`alignmentLength`
`protected int`	`alignmentResult`
`protected int`	`block` Stores the last block in use
`protected int`	`blockBit` Stores the number of trailing 0's in the blockSize.
`protected int`	`blockMask` equals blockSize-1
`protected int`	`blockSize` Stores the blockSize as a power of 2
`protected int`	`closedActions`
`protected int`	`costUpperLimit`
`protected ReplayAlgorithm.Debug`	`debug` Stores the selected debug level
`protected int`	`edgesTraversed`
`protected boolean`	`enabledBlockedByCost`
`protected static int`	`HEURISTICINFINITE`
`protected int`	`heuristicsComputed`
`protected int`	`heuristicsDerived`
`protected int`	`heuristicsEstimated`
`protected int`	`indexInBlock` Stores the first new index in current block
`protected int`	`iteration`
`protected int`	`markingsReached`
`protected int`	`maximumNumberOfStates`
`protected boolean`	`moveSorting` Indicate if moves should be considered totally ordered.
`protected SyncProduct`	`net` The synchronous product under investigation
`protected static int`	`NOPREDECESSOR`
`protected int`	`numPlaces`
`protected int`	`pollActions`
`protected boolean`	`preferExact` Flag indicating if exact solutions should be kept separate
`protected Queue`	`queue` Stores the open set as a priority queue
`protected int`	`queueActions`
`protected gnu.trove.map.TObjectIntMap<Utils.Statistic>`	`replayStatistics`
`protected static int`	`RESTART`
`protected int`	`runTime`
`protected int`	`setupTime`
`protected long`	`startConstructor`
`protected long`	`timeoutAtTimeInMillisecond`
`protected VisitedSet`	`visited` Stores the closed set

Constructor Summary

Constructors
Constructor and Description

Full(SyncProduct product)

Full(SyncProduct product, boolean moveSorting, boolean queueSorting, ReplayAlgorithm.Debug debug)

Constructors
Constructor and Description
`Full(SyncProduct product)`
`Full(SyncProduct product, boolean moveSorting, boolean queueSorting, ReplayAlgorithm.Debug debug)`

Method Summary

All Methods Instance Methods Concrete Methods
Modifier and Type	Method and Description
`int`	`addNewMarking(byte[] marking)` Adds a new marking to the internal storage.
`protected void`	`addToQueue(int marking)`
`protected ReplayAlgorithm.CloseResult`	`closeOrUpdateMarking(int m, byte[] marking_m, int bm, int im)`
`boolean`	`equalMarking(int marking1, byte[] marking2)` Checks equality of the stored marking1 to the given marking2.
`protected int`	`expandMarking(int m, byte[] marking_m, int bm, int im)`
`protected void`	`fillMarking(byte[] markingArray, int marking)`
`protected void`	`fillStatistics(int[] alignment)`
`protected void`	`fire(byte[] marking, int transition)`
`protected byte[]`	`fire(byte[] fromMarking, int transition, int block, int index)`
`protected int[]`	`getAlignmentWhenEmptyQueueReached(long startTime)`
`long`	`getEstimatedMemorySize()` Estimates the memory size of the internal data structures in bytes.
`int`	`getFScore(int marking)` Returns the f score for a stored marking
`int`	`getFScore(int block, int index)` Returns the f score for a stored marking
`int`	`getGScore(int marking)` Returns the g score for a stored marking
`int`	`getGScore(int block, int index)` Returns the g score for a stored marking
`int`	`getHScore(int marking)` Returns the h score for a stored marking
`int`	`getHScore(int block, int index)` Returns the h score for a stored marking
`int`	`getIterationNumber()` Returns the current iteration number of the algorithm if there are multiple iterations in which the same marking IDs will be present.
`int`	`getLastRankOf(int marking)` Returns the highest rank of an event explained by the path through which the stored marking with ID markingId was reached.
`byte[]`	`getMarking(int marking)` Returns the explicit representation of the marking stored with ID markingId.
`SyncProduct`	`getNet()` Returns the synchronous product for which this ReplayAlgorithm was instantiated
`int`	`getPathLength(int marking)` returns the length of the path from the initial marking to reach this marking
`int`	`getPredecessor(int marking)` Returns the predecessor for a stored marking
`int`	`getPredecessor(int block, int index)` Returns the predecessor for a stored marking
`int`	`getPredecessorTransition(int marking)` Returns the predecessor transition for a stored marking
`int`	`getPredecessorTransition(int block, int index)` Returns the predecessor transition for a stored marking
`gnu.trove.map.TObjectIntMap<Utils.Statistic>`	`getStatistics()` Obtain the statistics after computing an alignment.
`protected void`	`growArrays()` Grow the internal array structure.
`protected int[]`	`handleFinalMarkingReached(long startTime, int marking)`
`boolean`	`hasExactHeuristic(int marking)` returns true if the heuristic stored for the given marking is exact or an estimate.
`boolean`	`hasExactHeuristic(int block, int index)` returns true if the heuristic stored for the given marking is exact or an estimate.
`int`	`hashCode(byte[] marking)` Returns the hashCode of a stored marking which is provided as an array of length 2*bm, where the first bm bytes provide the low bits and the second bm bytes provide the high bits.
`int`	`hashCode(int marking)` Returns the hashCode of a stored marking
`boolean`	`hasPlaceBetween(int preTransition, int transition)` returns true if there is a place common in the output set of transitionFrom and the input set of transitionTo
`protected void`	`initializeIteration()`
`protected void`	`initializeIterationInternal()`
`boolean`	`isClosed(int marking)` Returns true if marking is in the closed set
`boolean`	`isClosed(int block, int index)` Returns the g score for a stored marking
`protected boolean`	`isEnabled(byte[] marking, int transition, int block, int index)`
`protected boolean`	`isFinal(int marking)` To allow for prefix versions of this algorithm, ask the net if the given marking is final.
`boolean`	`isInfinite(int heur)` Checks if a value for the h-score is INFINITE.
`protected void`	`processedMarking(int marking, int blockMarking, int indexInBlock)`
`void`	`putStatistic(Utils.Statistic stat, int value)` Adds a statistic to the set of statistics.
`int[]`	`run(nl.tue.alignment.Canceler canceller, int timeoutMilliseconds, int maximumNumberOfStates, int costUpperLimit)` Run the replay algorithm.
`protected int[]`	`runReplayAlgorithm(nl.tue.alignment.Canceler canceller, long startTime, int timeoutMilliseconds)`
`void`	`setClosed(int marking)` Set the g score for a stored marking
`void`	`setClosed(int block, int index)` Set the g score for a stored marking
`void`	`setGScore(int marking, int score)` Set the g score for a stored marking
`void`	`setGScore(int block, int index, int score)` Set the g score for a stored marking
`void`	`setHScore(int marking, int score, boolean isExact)` Set the h score for a stored marking
`void`	`setHScore(int block, int index, int score, boolean isExact)` set the h score for a stored marking
`void`	`setPredecessor(int marking, int predecessorMarking)` Sets the predecessor for a stored marking
`void`	`setPredecessor(int block, int index, int predecessorMarking)` Sets the predecessor for a stored marking
`void`	`setPredecessorTransition(int marking, int transition)` Sets the predecessor transition for a stored marking
`void`	`setPredecessorTransition(int block, int index, int transition)` Sets the predecessor transition for a stored marking
`protected void`	`terminateIteration(int[] alignment, int markingsReachedInRun, int closedActionsInRun)`
`protected void`	`writeEdgeTraversed(ReplayAlgorithm algorithm, int fromMarking, int transition, int toMarking, java.lang.String extra)`
`protected void`	`writeEndOfAlignmentDot(int[] alignment, int markingsReachedInRun, int closedActionsInRun)`
`protected void`	`writeEndOfAlignmentNormal(int[] alignment, int markingsReachedInRun, int closedActionsInRun)`
`protected void`	`writeEndOfAlignmentStats(int[] alignment, int markingsReachedInRun, int closedActionsInRun)`
`protected void`	`writeStatus()`

Methods inherited from class org.processmining.multilayeralignment.algorithms.implementations.Dijkstra
deriveOrEstimateHValue, getExactHeuristic

Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

- Field Detail
  - RESTART
```
protected static final int RESTART
```
    See Also:
    
    Constant Field Values
  - visited
```
protected VisitedSet visited
```
    Stores the closed set
  - net
```
protected final SyncProduct net
```
    The synchronous product under investigation
  - queue
```
protected Queue queue
```
    Stores the open set as a priority queue
  - moveSorting
```
protected boolean moveSorting
```
    Indicate if moves should be considered totally ordered.
  - debug
```
protected final ReplayAlgorithm.Debug debug
```
    Stores the selected debug level
  - preferExact
```
protected final boolean preferExact
```
    Flag indicating if exact solutions should be kept separate
  - pollActions
```
protected int pollActions
```
  - closedActions
```
protected int closedActions
```
  - queueActions
```
protected int queueActions
```
  - edgesTraversed
```
protected int edgesTraversed
```
  - enabledBlockedByCost
```
protected boolean enabledBlockedByCost
```
  - markingsReached
```
protected int markingsReached
```
  - heuristicsComputed
```
protected int heuristicsComputed
```
  - heuristicsEstimated
```
protected int heuristicsEstimated
```
  - heuristicsDerived
```
protected int heuristicsDerived
```
  - alignmentLength
```
protected int alignmentLength
```
  - alignmentCost
```
protected int alignmentCost
```
  - setupTime
```
protected int setupTime
```
  - runTime
```
protected int runTime
```
  - iteration
```
protected int iteration
```
  - startConstructor
```
protected long startConstructor
```
  - numPlaces
```
protected int numPlaces
```
  - timeoutAtTimeInMillisecond
```
protected long timeoutAtTimeInMillisecond
```
  - maximumNumberOfStates
```
protected int maximumNumberOfStates
```
  - costUpperLimit
```
protected int costUpperLimit
```
  - replayStatistics
```
protected gnu.trove.map.TObjectIntMap<Utils.Statistic> replayStatistics
```
  - HEURISTICINFINITE
```
protected static int HEURISTICINFINITE
```
  - NOPREDECESSOR
```
protected static final int NOPREDECESSOR
```
    See Also:
    
    Constant Field Values
  - alignmentResult
```
protected int alignmentResult
```
  - blockSize
```
protected final int blockSize
```
    Stores the blockSize as a power of 2
  - blockBit
```
protected final int blockBit
```
    Stores the number of trailing 0's in the blockSize.
  - blockMask
```
protected final int blockMask
```
    equals blockSize-1
  - block
```
protected int block
```
    Stores the last block in use
  - indexInBlock
```
protected int indexInBlock
```
    Stores the first new index in current block
- Constructor Detail
  - Full
```
public Full(SyncProduct product)
```
  - Full
```
public Full(SyncProduct product,
            boolean moveSorting,
            boolean queueSorting,
            ReplayAlgorithm.Debug debug)
```
- Method Detail
  - isFinal
```
protected boolean isFinal(int marking)
```
    Description copied from class: Dijkstra
    
    To allow for prefix versions of this algorithm, ask the net if the given marking is final.
    
    Overrides:
    
    isFinal in class Dijkstra
  - getAlignmentWhenEmptyQueueReached
```
protected int[] getAlignmentWhenEmptyQueueReached(long startTime)
```
  - getStatistics
```
public gnu.trove.map.TObjectIntMap<Utils.Statistic> getStatistics()
```
    Description copied from interface: ReplayAlgorithm
    
    Obtain the statistics after computing an alignment. Should only be called after a call to run();
    
    Returns:
  - fillStatistics
```
protected void fillStatistics(int[] alignment)
```
  - getEstimatedMemorySize
```
public long getEstimatedMemorySize()
```
    Description copied from interface: ReplayAlgorithm
    
    Estimates the memory size of the internal data structures in bytes.
    
    Specified by:
    
    getEstimatedMemorySize in interface ReplayAlgorithm
    
    Returns:
    
    The estimated memory size of the internal data structures in bytes.
  - run
```
public int[] run(nl.tue.alignment.Canceler canceller,
                 int timeoutMilliseconds,
                 int maximumNumberOfStates,
                 int costUpperLimit)
          throws nl.tue.astar.util.ilp.LPMatrixException
```
    Description copied from interface: ReplayAlgorithm
    
    Run the replay algorithm. The canceler is provided for cancellation purposes. A timeout is specified in milliseconds and a maximum number of states is also provided. Furthermore, as cost upper limit can be given to bound the search.
    
    Parameters:
    
    canceller - Allows for canceling the computation
    
    timeoutMilliseconds - Timeout for the computation
    
    maximumNumberOfStates - Maximum number of states expanded
    
    costUpperLimit - Maximum cost of the alignment. Providing an upperbound of 0 will answer the yes/no question if the trace is fitting (assuming synchronous and tau-moves have cost 0)
    
    Returns:
    
    alignment as a sequence of transition firings from the initial marking to (1) the final marking if the computation is succesful or (2) any marking if it is not succesful
    
    Throws:
    
    nl.tue.astar.util.ilp.LPMatrixException - Exceptions is thrown if there is a problem with the LP computations.
  - runReplayAlgorithm
```
protected int[] runReplayAlgorithm(nl.tue.alignment.Canceler canceller,
                                   long startTime,
                                   int timeoutMilliseconds)
                            throws nl.tue.astar.util.ilp.LPMatrixException
```
    Throws:
    
    nl.tue.astar.util.ilp.LPMatrixException
  - expandMarking
```
protected int expandMarking(int m,
                            byte[] marking_m,
                            int bm,
                            int im)
```
  - writeEdgeTraversed
```
protected void writeEdgeTraversed(ReplayAlgorithm algorithm,
                                  int fromMarking,
                                  int transition,
                                  int toMarking,
                                  java.lang.String extra)
```
  - closeOrUpdateMarking
```
protected ReplayAlgorithm.CloseResult closeOrUpdateMarking(int m,
                                                           byte[] marking_m,
                                                           int bm,
                                                           int im)
```
  - initializeIteration
```
protected void initializeIteration()
                            throws nl.tue.astar.util.ilp.LPMatrixException
```
    Throws:
    
    nl.tue.astar.util.ilp.LPMatrixException - in subclasses using (I)LP
  - initializeIterationInternal
```
protected void initializeIterationInternal()
```
  - addToQueue
```
protected void addToQueue(int marking)
```
  - processedMarking
```
protected void processedMarking(int marking,
                                int blockMarking,
                                int indexInBlock)
```
  - handleFinalMarkingReached
```
protected int[] handleFinalMarkingReached(long startTime,
                                          int marking)
```
  - writeEndOfAlignmentStats
```
protected void writeEndOfAlignmentStats(int[] alignment,
                                        int markingsReachedInRun,
                                        int closedActionsInRun)
```
  - writeEndOfAlignmentNormal
```
protected void writeEndOfAlignmentNormal(int[] alignment,
                                         int markingsReachedInRun,
                                         int closedActionsInRun)
```
  - writeEndOfAlignmentDot
```
protected void writeEndOfAlignmentDot(int[] alignment,
                                      int markingsReachedInRun,
                                      int closedActionsInRun)
```
  - terminateIteration
```
protected void terminateIteration(int[] alignment,
                                  int markingsReachedInRun,
                                  int closedActionsInRun)
```
  - fire
```
protected byte[] fire(byte[] fromMarking,
                      int transition,
                      int block,
                      int index)
```
  - fire
```
protected void fire(byte[] marking,
                    int transition)
```
  - isEnabled
```
protected boolean isEnabled(byte[] marking,
                            int transition,
                            int block,
                            int index)
```
  - hasPlaceBetween
```
public boolean hasPlaceBetween(int preTransition,
                               int transition)
```
    returns true if there is a place common in the output set of transitionFrom and the input set of transitionTo
    
    Parameters:
    
    transitionFrom -
    
    transitionTo -
    
    Returns:
  - getMarking
```
public byte[] getMarking(int marking)
```
    Description copied from interface: ReplayAlgorithm
    
    Returns the explicit representation of the marking stored with ID markingId.
    
    Parameters:
    
    marking - an ID of a previously stored marking (ID obtained through addNewMarking())
    
    Returns:
    
    the explicit representation of the marking
  - fillMarking
```
protected void fillMarking(byte[] markingArray,
                           int marking)
```
  - addNewMarking
```
public int addNewMarking(byte[] marking)
```
    Description copied from interface: ReplayAlgorithm
    
    Adds a new marking to the internal storage. Method should only be called if it does not exist already.
    
    Parameters:
    
    marking - the byte[] indicating the number of tokens per place
    
    Returns:
    
    the id of the marking in the internal storage.
  - writeStatus
```
protected void writeStatus()
```
  - equalMarking
```
public boolean equalMarking(int marking1,
                            byte[] marking2)
```
    Checks equality of the stored marking1 to the given marking2.
    
    Parameters:
    
    marking1 -
    
    marking2 -
    
    Returns:
    
    See Also:
    
    SyncProduct.getInitialMarking();
  - hashCode
```
public int hashCode(int marking)
```
    Returns the hashCode of a stored marking
    
    Parameters:
    
    marking -
    
    Returns:
  - hashCode
```
public int hashCode(byte[] marking)
```
    Returns the hashCode of a stored marking which is provided as an array of length 2*bm, where the first bm bytes provide the low bits and the second bm bytes provide the high bits.
    
    Parameters:
    
    marking -
    
    Returns:
    
    See Also:
    
    SyncProduct.getInitialMarking();
  - getNet
```
public SyncProduct getNet()
```
    Description copied from interface: ReplayAlgorithm
    
    Returns the synchronous product for which this ReplayAlgorithm was instantiated
    
    Returns:
    
    the synchronous product
  - getLastRankOf
```
public int getLastRankOf(int marking)
```
    Description copied from interface: ReplayAlgorithm
    
    Returns the highest rank of an event explained by the path through which the stored marking with ID markingId was reached.
    
    Parameters:
    
    marking - an ID of a previously stored marking (ID obtained through addNewMarking()
    
    Returns:
    
    the highest rank of any event explained by a path to this marking.
  - putStatistic
```
public void putStatistic(Utils.Statistic stat,
                         int value)
```
    Description copied from interface: ReplayAlgorithm
    
    Adds a statistic to the set of statistics. Can be called before or after run(), but the run() method may overwrite previously added statistics.
  - getIterationNumber
```
public int getIterationNumber()
```
    Description copied from interface: ReplayAlgorithm
    
    Returns the current iteration number of the algorithm if there are multiple iterations in which the same marking IDs will be present. This method is needed for DOT output to separate the nodes in the iterations.
    
    Returns:
    
    the iteration number
  - getPathLength
```
public int getPathLength(int marking)
```
    Description copied from interface: ReplayAlgorithm
    
    returns the length of the path from the initial marking to reach this marking
    
    Returns:
  - growArrays
```
protected void growArrays()
```
    Grow the internal array structure. Method should be considered synchronized as it should not be executed in parallel.
  - getGScore
```
public int getGScore(int block,
                     int index)
```
    Returns the g score for a stored marking
    
    Parameters:
    
    block - the memory block the marking is stored in
    
    index - the index at which the marking is stored in the memory block
    
    Returns:
  - setGScore
```
public void setGScore(int block,
                      int index,
                      int score)
```
    Set the g score for a stored marking
    
    Parameters:
    
    block - the memory block the marking is stored in
    
    index - the index at which the marking is stored in the memory block
  - setGScore
```
public void setGScore(int marking,
                      int score)
```
    Set the g score for a stored marking
    
    Parameters:
    
    marking -
  - getHScore
```
public int getHScore(int marking)
```
    Returns the h score for a stored marking
    
    Specified by:
    
    getHScore in interface ReplayAlgorithm
    
    Parameters:
    
    marking -
    
    Returns:
  - getHScore
```
public int getHScore(int block,
                     int index)
```
    Returns the h score for a stored marking
    
    Parameters:
    
    block - the memory block the marking is stored in
    
    index - the index at which the marking is stored in the memory block
    
    Returns:
  - setHScore
```
public void setHScore(int block,
                      int index,
                      int score,
                      boolean isExact)
```
    set the h score for a stored marking
    
    Parameters:
    
    block - the memory block the marking is stored in
    
    index - the index at which the marking is stored in the memory block
  - setHScore
```
public void setHScore(int marking,
                      int score,
                      boolean isExact)
```
    Set the h score for a stored marking
    
    Parameters:
    
    marking -
  - getPredecessor
```
public int getPredecessor(int marking)
```
    Returns the predecessor for a stored marking
    
    Parameters:
    
    marking -
    
    Returns:
  - getPredecessor
```
public int getPredecessor(int block,
                          int index)
```
    Returns the predecessor for a stored marking
    
    Parameters:
    
    block - the memory block the marking is stored in
    
    index - the index at which the marking is stored in the memory block
    
    Returns:
  - setPredecessor
```
public void setPredecessor(int block,
                           int index,
                           int predecessorMarking)
```
    Sets the predecessor for a stored marking
    
    Parameters:
    
    block - the memory block the marking is stored in
    
    index - the index at which the marking is stored in the memory block
  - setPredecessor
```
public void setPredecessor(int marking,
                           int predecessorMarking)
```
    Sets the predecessor for a stored marking
    
    Parameters:
    
    marking -
  - getPredecessorTransition
```
public int getPredecessorTransition(int marking)
```
    Returns the predecessor transition for a stored marking
    
    Parameters:
    
    marking -
    
    Returns:
  - getPredecessorTransition
```
public int getPredecessorTransition(int block,
                                    int index)
```
    Returns the predecessor transition for a stored marking
    
    Parameters:
    
    block - the memory block the marking is stored in
    
    index - the index at which the marking is stored in the memory block
    
    Returns:
  - setPredecessorTransition
```
public void setPredecessorTransition(int block,
                                     int index,
                                     int transition)
```
    Sets the predecessor transition for a stored marking
    
    Parameters:
    
    block - the memory block the marking is stored in
    
    index - the index at which the marking is stored in the memory block
  - setPredecessorTransition
```
public void setPredecessorTransition(int marking,
                                     int transition)
```
    Sets the predecessor transition for a stored marking
    
    Parameters:
    
    marking -
  - isClosed
```
public boolean isClosed(int marking)
```
    Returns true if marking is in the closed set
    
    Specified by:
    
    isClosed in interface ReplayAlgorithm
    
    Parameters:
    
    marking -
    
    Returns:
  - isClosed
```
public boolean isClosed(int block,
                        int index)
```
    Returns the g score for a stored marking
    
    Parameters:
    
    block - the memory block the marking is stored in
    
    index - the index at which the marking is stored in the memory block
    
    Returns:
  - setClosed
```
public void setClosed(int block,
                      int index)
```
    Set the g score for a stored marking
    
    Parameters:
    
    block - the memory block the marking is stored in
    
    index - the index at which the marking is stored in the memory block
  - setClosed
```
public void setClosed(int marking)
```
    Set the g score for a stored marking
    
    Parameters:
    
    marking -
  - getFScore
```
public int getFScore(int marking)
```
    Returns the f score for a stored marking
    
    Specified by:
    
    getFScore in interface ReplayAlgorithm
    
    Parameters:
    
    marking -
    
    Returns:
  - getFScore
```
public int getFScore(int block,
                     int index)
```
    Returns the f score for a stored marking
    
    Parameters:
    
    block - the memory block the marking is stored in
    
    index - the index at which the marking is stored in the memory block
    
    Returns:
  - getGScore
```
public int getGScore(int marking)
```
    Returns the g score for a stored marking
    
    Specified by:
    
    getGScore in interface ReplayAlgorithm
    
    Parameters:
    
    marking -
    
    Returns:
  - hasExactHeuristic
```
public boolean hasExactHeuristic(int marking)
```
    returns true if the heuristic stored for the given marking is exact or an estimate.
    
    Specified by:
    
    hasExactHeuristic in interface ReplayAlgorithm
    
    Parameters:
    
    marking -
    
    Returns:
  - hasExactHeuristic
```
public boolean hasExactHeuristic(int block,
                                 int index)
```
    returns true if the heuristic stored for the given marking is exact or an estimate.
    
    Parameters:
    
    marking -
    
    block - the memory block the marking is stored in
    
    index - the index at which the marking is stored in the memory block
    
    Returns:
  - isInfinite
```
public boolean isInfinite(int heur)
```
    Description copied from interface: ReplayAlgorithm
    
    Checks if a value for the h-score is INFINITE.
    
    Specified by:
    
    isInfinite in interface ReplayAlgorithm
    
    Parameters:
    
    heur - a value for the h-score
    
    Returns:
    
    true if the provided value is considered INFINITE

Class Dijkstra.Full

Nested Class Summary

Nested classes/interfaces inherited from class org.processmining.multilayeralignment.algorithms.implementations.Dijkstra

Nested classes/interfaces inherited from interface org.processmining.multilayeralignment.algorithms.ReplayAlgorithm

Field Summary

Constructor Summary

Method Summary

Methods inherited from class org.processmining.multilayeralignment.algorithms.implementations.Dijkstra

Methods inherited from class java.lang.Object

Field Detail

RESTART

visited

net

queue

moveSorting

debug

preferExact

pollActions

closedActions

queueActions

edgesTraversed

enabledBlockedByCost

markingsReached

heuristicsComputed

heuristicsEstimated

heuristicsDerived

alignmentLength

alignmentCost

setupTime

runTime

iteration

startConstructor

numPlaces

timeoutAtTimeInMillisecond

maximumNumberOfStates

costUpperLimit

replayStatistics

HEURISTICINFINITE

NOPREDECESSOR

alignmentResult

blockSize

blockBit

blockMask

block

indexInBlock

Constructor Detail

Full

Full

Method Detail

isFinal

getAlignmentWhenEmptyQueueReached

getStatistics

fillStatistics

getEstimatedMemorySize

run

runReplayAlgorithm

expandMarking

writeEdgeTraversed

closeOrUpdateMarking

initializeIteration

initializeIterationInternal

addToQueue

processedMarking

handleFinalMarkingReached

writeEndOfAlignmentStats

writeEndOfAlignmentNormal

writeEndOfAlignmentDot

terminateIteration

fire

fire

isEnabled

hasPlaceBetween

getMarking

fillMarking

addNewMarking

writeStatus

equalMarking

hashCode

hashCode

getNet