public class AllKnotSamplingOptAlignmentsGraphAlg extends AllOptAlignmentsGraphAlg
AbstractAllOptAlignmentsGraphAlg.MatchInstancesGraphRes
threads
classifier, finalMarkings, initMarking, mapEvClass2Cost, mapTrans2Cost, MAPTRANSTOCOST, MAPXEVENTCLASSTOCOST, MAXEXPLOREDINSTANCES, maxNumOfStates, queuedStates, traversedArcs, visitedStates
Constructor and Description |
---|
AllKnotSamplingOptAlignmentsGraphAlg() |
Modifier and Type | Method and Description |
---|---|
protected double |
constructResult(PRecord r,
PDelegate d,
org.deckfour.xes.model.XTrace trace,
nl.tue.astar.Trace filteredTrace,
boolean isFirst,
java.util.List<java.util.List<java.lang.Object>> lstNodeInstanceLst,
java.util.List<java.util.List<StepTypes>> lstStepTypesLst) |
protected int |
countOptimalAlignments(nl.tue.astar.Record r,
java.util.Map<nl.tue.astar.Record,java.util.List<nl.tue.astar.Record>> mapToStatesWSameSuffix) |
java.lang.String |
getHTMLInfo()
HTML explanation of the algorithm
|
protected AllOptAlignmentsGraphThread<PHead,nl.tue.astar.impl.DijkstraTail> |
getThread(nl.tue.astar.impl.memefficient.MemoryEfficientAStarAlgorithm<PHead,nl.tue.astar.impl.DijkstraTail> aStar,
PHead initial,
nl.tue.astar.Trace trace,
int maxNumOfStates)
Since we only need samples, sorting may take place
|
protected boolean |
isRepresentedCounted()
True if the number of represented optimal alignments per alignments is
also computed Setting this to true leads to much more expensive
computation
|
protected AllSyncReplayResult |
recordToResult(PDelegate d,
org.deckfour.xes.model.XTrace trace,
nl.tue.astar.Trace filteredTrace,
java.util.Collection<PRecord> records,
int traceIndex,
int states,
int queuedStates,
boolean isReliable,
long milliseconds,
java.util.List<java.lang.Object> suffixNodeInstance,
java.util.List<StepTypes> suffixStepTypes,
AllSyncReplayResult prevResult,
java.util.Map<nl.tue.astar.Record,java.util.List<nl.tue.astar.Record>> mapToStatesWSameSuffix)
Recursive call that investigate the same map
|
java.lang.String |
toString() |
getDelegate, replayLog
addReplayResults, extractAllHistory
compareEventClassList, getLinearTrace, getPartiallyOrderedTrace
public AllKnotSamplingOptAlignmentsGraphAlg()
public java.lang.String toString()
toString
in interface IPNMatchInstancesLogReplayAlgorithm
toString
in class AllOptAlignmentsGraphAlg
public java.lang.String getHTMLInfo()
IPNMatchInstancesLogReplayAlgorithm
getHTMLInfo
in interface IPNMatchInstancesLogReplayAlgorithm
getHTMLInfo
in class AllOptAlignmentsGraphAlg
protected AllOptAlignmentsGraphThread<PHead,nl.tue.astar.impl.DijkstraTail> getThread(nl.tue.astar.impl.memefficient.MemoryEfficientAStarAlgorithm<PHead,nl.tue.astar.impl.DijkstraTail> aStar, PHead initial, nl.tue.astar.Trace trace, int maxNumOfStates) throws nl.tue.astar.AStarException
getThread
in class AllOptAlignmentsGraphAlg
nl.tue.astar.AStarException
protected AllSyncReplayResult recordToResult(PDelegate d, org.deckfour.xes.model.XTrace trace, nl.tue.astar.Trace filteredTrace, java.util.Collection<PRecord> records, int traceIndex, int states, int queuedStates, boolean isReliable, long milliseconds, java.util.List<java.lang.Object> suffixNodeInstance, java.util.List<StepTypes> suffixStepTypes, AllSyncReplayResult prevResult, java.util.Map<nl.tue.astar.Record,java.util.List<nl.tue.astar.Record>> mapToStatesWSameSuffix)
AbstractAllOptAlignmentsGraphAlg
recordToResult
in class AbstractAllOptAlignmentsGraphAlg<PDelegate,nl.tue.astar.impl.DijkstraTail>
protected boolean isRepresentedCounted()
protected double constructResult(PRecord r, PDelegate d, org.deckfour.xes.model.XTrace trace, nl.tue.astar.Trace filteredTrace, boolean isFirst, java.util.List<java.util.List<java.lang.Object>> lstNodeInstanceLst, java.util.List<java.util.List<StepTypes>> lstStepTypesLst)
protected int countOptimalAlignments(nl.tue.astar.Record r, java.util.Map<nl.tue.astar.Record,java.util.List<nl.tue.astar.Record>> mapToStatesWSameSuffix)