Class SearchGraphPT
- java.lang.Object
-
- org.processmining.ptrframework.algorithms.treereplay.PM4PYApproach.SearchGraphPT
-
public class SearchGraphPT extends java.lang.Object
-
-
Nested Class Summary
Nested Classes Modifier and Type Class Description static classSearchGraphPT.SGASearchState
-
Constructor Summary
Constructors Constructor Description SearchGraphPT()
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description voidaddNewState(SearchGraphPT.SGASearchState state, SearchGraphPT.SGASearchState parent, java.util.PriorityQueue<SearchGraphPT.SGASearchState> openStates, java.util.HashSet<SearchGraphPT.SGASearchState> closedStates)SGASearchResultalignVariant(java.util.List<java.lang.String> variant, java.util.HashSet<Pair<java.lang.Integer,ReplayProcessTree>> treeLeafSet, ReplayProcessTree pt)java.util.HashMap<java.util.List<java.lang.String>,SGASearchResult>applyToVariantStrings(java.util.Collection<java.util.List<java.lang.String>> variants, ReplayProcessTree pt)SGASearchResultapplyVariant(java.util.List<java.lang.String> variant, ReplayProcessTree pt)booleancheckIfStateExistsAndUpdate(SearchGraphPT.SGASearchState searchState, java.util.Collection<SearchGraphPT.SGASearchState> states)SGASearchResultconstructResultDictionary(SearchGraphPT.SGASearchState state, java.util.List<java.lang.String> variant)booleanisFinalTreeState(ProcessTreeState state, ReplayProcessTree pt)booleanneedLogMove(ProcessTreeState oldState, ProcessTreeState newState, java.util.List<Pair<ReplayProcessTree,org.processmining.ptrframework.algorithms.treereplay.PM4PYApproach.ReplayProcessTree.OperatorState>> path)java.util.LinkedList<ReplayProcessTree>obtainLeavesFromStatePath(java.util.List<Pair<ReplayProcessTree,org.processmining.ptrframework.algorithms.treereplay.PM4PYApproach.ReplayProcessTree.OperatorState>> path, boolean includeTau)voidupdateCostsRecursively(float delta, java.util.Collection<SearchGraphPT.SGASearchState> states)
-
-
-
Method Detail
-
constructResultDictionary
public SGASearchResult constructResultDictionary(SearchGraphPT.SGASearchState state, java.util.List<java.lang.String> variant)
-
isFinalTreeState
public boolean isFinalTreeState(ProcessTreeState state, ReplayProcessTree pt)
-
updateCostsRecursively
public void updateCostsRecursively(float delta, java.util.Collection<SearchGraphPT.SGASearchState> states)
-
checkIfStateExistsAndUpdate
public boolean checkIfStateExistsAndUpdate(SearchGraphPT.SGASearchState searchState, java.util.Collection<SearchGraphPT.SGASearchState> states)
-
addNewState
public void addNewState(SearchGraphPT.SGASearchState state, SearchGraphPT.SGASearchState parent, java.util.PriorityQueue<SearchGraphPT.SGASearchState> openStates, java.util.HashSet<SearchGraphPT.SGASearchState> closedStates)
-
obtainLeavesFromStatePath
public java.util.LinkedList<ReplayProcessTree> obtainLeavesFromStatePath(java.util.List<Pair<ReplayProcessTree,org.processmining.ptrframework.algorithms.treereplay.PM4PYApproach.ReplayProcessTree.OperatorState>> path, boolean includeTau)
-
needLogMove
public boolean needLogMove(ProcessTreeState oldState, ProcessTreeState newState, java.util.List<Pair<ReplayProcessTree,org.processmining.ptrframework.algorithms.treereplay.PM4PYApproach.ReplayProcessTree.OperatorState>> path)
-
alignVariant
public SGASearchResult alignVariant(java.util.List<java.lang.String> variant, java.util.HashSet<Pair<java.lang.Integer,ReplayProcessTree>> treeLeafSet, ReplayProcessTree pt)
-
applyVariant
public SGASearchResult applyVariant(java.util.List<java.lang.String> variant, ReplayProcessTree pt)
-
applyToVariantStrings
public java.util.HashMap<java.util.List<java.lang.String>,SGASearchResult> applyToVariantStrings(java.util.Collection<java.util.List<java.lang.String>> variants, ReplayProcessTree pt)
-
-