Modifier and Type | Method and Description |
---|---|
protected boolean |
FusionStrategyIncrBinaryImpl.areValidMatch(ENode sourceInSourceREG,
RepEGraph sourceREG,
ENode targetInTargetREG,
RepEGraph targetREG) |
protected boolean |
FusionStrategyIncrFilteringImpl.areValidMatch(ENode sourceInSourceREG,
RepEGraph sourceREG,
ENode targetInTargetREG,
RepEGraph targetREG) |
Modifier and Type | Method and Description |
---|---|
ENode |
EGraphFactory.createArtificalEnd(EGraph eg) |
ENode |
EGraphFactory.createArtificalEnd(EGraph eg,
int[] preds) |
ENode |
EGraphFactory.createArtificalStart(EGraph eg) |
ENode |
EGraphFactory.createArtificalStart(EGraph eg,
int[] succs) |
ENode |
EGraphFactory.createNode(EGraph graph,
ENode node) |
ENode |
EGraphFactory.createNode(EGraph eg,
org.deckfour.xes.classification.XEventClass c,
java.util.List<java.lang.Integer> predIds,
java.util.List<java.lang.Integer> succIds,
java.util.List<java.lang.Integer> concIds) |
ENode |
EGraphFactory.createNode(EGraph eg,
org.deckfour.xes.classification.XEventClass c,
java.util.List<java.lang.Integer> predIds,
java.util.List<java.lang.Integer> succIds,
java.util.List<java.lang.Integer> concIds,
int[] preds,
int[] succs,
int[] concs) |
ENode |
EGraph.getNodeById(int id) |
ENode |
RepEGraph.getNodeRepresenting(int graphId,
int nodeId) |
Modifier and Type | Method and Description |
---|---|
java.util.List<ENode> |
EGraph.getNodes() |
java.util.List<ENode> |
EGraph.getNodesWithLabel(ENode sourceNode) |
Modifier and Type | Method and Description |
---|---|
void |
MatchMapping.addMatch(ENode sourceNode,
ENode targetNode)
This function add a mapping between the sourceNode and the targetNode.
|
int |
EGraph.addNode(ENode node) |
ENode |
EGraphFactory.createNode(EGraph graph,
ENode node) |
java.util.List<ENode> |
EGraph.getNodesWithLabel(ENode sourceNode) |
boolean |
EGraphFactory.isArtifical(ENode node) |
boolean |
EGraphFactory.isArtificalEnd(ENode node) |
boolean |
EGraphFactory.isArtificalStart(ENode node) |
void |
MatchMapping.removeMatch(ENode source,
ENode target) |
void |
EGraph.removeNode(ENode node) |
Modifier and Type | Class and Description |
---|---|
class |
ENodeAbstract |
class |
ENodeAwareImpl |
class |
ENodeDummyImpl |
Modifier and Type | Field and Description |
---|---|
protected java.util.List<ENode> |
EGraphImp.nodes |
Modifier and Type | Method and Description |
---|---|
ENode |
EGraphImp.getNodeById(int id) |
ENode |
RepEGraphImpl.getNodeRepresenting(int graphId,
int nodeId) |
Modifier and Type | Method and Description |
---|---|
java.util.List<ENode> |
EGraphImp.getNodes() |
java.util.List<ENode> |
EGraphImp.getNodesWithLabel(ENode sourceNode) |
Modifier and Type | Method and Description |
---|---|
void |
MatchMappingImpl.addMatch(ENode sourceNode,
ENode targetNode) |
int |
EGraphImp.addNode(ENode node) |
java.util.List<ENode> |
EGraphImp.getNodesWithLabel(ENode sourceNode) |
void |
MatchMappingImpl.removeMatch(ENode source,
ENode target) |
void |
EGraphImp.removeNode(ENode node) |
void |
RepEGraphImpl.removeNode(ENode node) |
Modifier and Type | Method and Description |
---|---|
int |
ENodeContextAndLabelComparator.compare(ENode s,
ENode t) |
int |
ENodeContextComparator.compare(ENode s,
ENode t) |
int |
HeuristicStrategy.getCost(ENode source,
ENode target,
MatchMapping mappingSoFar) |
int |
HeuristicStrategy.getCostNoMatch(ENode n,
MatchMapping mappingSoFar) |
Modifier and Type | Method and Description |
---|---|
java.util.Comparator<? super ENode> |
MatchingAlgGreedyImp.getENodeComparator() |
Modifier and Type | Method and Description |
---|---|
int |
CostHeuristicFunctionSimpleImpl.getCost(ENode source,
ENode target) |
int |
CostFunctionImpl.getCost(ENode source,
ENode target,
MatchMapping mapping) |
protected int |
CostFunctionNeighborAsMultisetImpl.getCost(ENode source,
ENode target,
MatchMapping mapping) |
int |
CostHeuristicFunctionComplexImpl.getCost(ENode source,
ENode target,
MatchMapping mapping) |
int |
CostHeuristicFunctionSimpleImpl.getCost(ENode source,
ENode target,
MatchMapping mapping) |
protected abstract int |
CostStrategyAbstract.getCost(ENode sourceNode,
ENode targetNode,
MatchMapping mapping) |
int |
CostHeuristicFunctionSimpleImpl.getCostNoMapping(ENode n) |
int |
CostFunctionImpl.getCostNoMatch(ENode n,
MatchMapping mapping) |
int |
CostFunctionNeighborAsMultisetImpl.getCostNoMatch(ENode n,
MatchMapping mapping) |
int |
CostHeuristicFunctionComplexImpl.getCostNoMatch(ENode n,
MatchMapping mapping) |
int |
CostHeuristicFunctionSimpleImpl.getCostNoMatch(ENode n,
MatchMapping mapping) |
protected abstract int |
CostStrategyAbstract.getCostNoMatch(ENode nodeById,
MatchMapping mapping) |
protected java.util.List<java.lang.Integer> |
MatchingAlgAbstract.getNodesAllowedToMap(ENode source,
java.util.List<ENode> targets) |
Modifier and Type | Method and Description |
---|---|
protected int |
MatchingAlgBackTrackingPruningImpl.computeActualCostAndUpdateOptMapping(java.util.List<ENode> sources,
java.util.List<ENode> targets,
MatchMapping mapping,
int costSoFar,
java.util.List<MatchMapping> optMappings,
int minCost) |
protected int |
MatchingAlgBackTrackingPruningImpl.computeActualCostAndUpdateOptMapping(java.util.List<ENode> sources,
java.util.List<ENode> targets,
MatchMapping mapping,
int costSoFar,
java.util.List<MatchMapping> optMappings,
int minCost) |
protected java.util.List<java.lang.Integer> |
MatchingAlgAbstract.getNodesAllowedToMap(ENode source,
java.util.List<ENode> targets) |
protected void |
MatchingAlgAbstract.matchDummyStartEndAndUpdateMapping(java.util.Collection<ENode> sources,
java.util.Collection<ENode> targets,
MatchMapping mapping) |
protected void |
MatchingAlgAbstract.matchDummyStartEndAndUpdateMapping(java.util.Collection<ENode> sources,
java.util.Collection<ENode> targets,
MatchMapping mapping) |
protected void |
MatchingAlgAbstract.matchOtherLabels(java.util.Collection<ENode> sources,
java.util.Collection<ENode> targets,
MatchMapping mapping) |
protected void |
MatchingAlgAbstract.matchOtherLabels(java.util.Collection<ENode> sources,
java.util.Collection<ENode> targets,
MatchMapping mapping) |
protected void |
MatchingAllAlgBackTrackingBFImpl.recurse(java.util.List<ENode> sources,
java.util.List<ENode> targets,
MatchMapping mapping,
java.util.List<MatchMapping> mappings,
int minCost) |
protected void |
MatchingAllAlgBackTrackingBFImpl.recurse(java.util.List<ENode> sources,
java.util.List<ENode> targets,
MatchMapping mapping,
java.util.List<MatchMapping> mappings,
int minCost) |
protected int |
MatchingAlgBackTrackingPruningImpl.recursePruning(java.util.List<ENode> sources,
java.util.List<ENode> targets,
MatchMapping mapping,
java.lang.Integer costSoFar,
java.util.List<MatchMapping> optMappings,
java.lang.Integer minCost) |
protected int |
MatchingAlgBackTrackingPruningImpl.recursePruning(java.util.List<ENode> sources,
java.util.List<ENode> targets,
MatchMapping mapping,
java.lang.Integer costSoFar,
java.util.List<MatchMapping> optMappings,
java.lang.Integer minCost) |
void |
MatchingAlgGreedyImp.setNodeComparator(java.util.Comparator<? super ENode> eNodeContextComparator) |
Constructor and Description |
---|
POMatchNode(org.processmining.partialorder.models.graph.PartialOrderGraph graph,
java.lang.String label,
ENode n) |
Modifier and Type | Method and Description |
---|---|
static QualityTFPN |
EGFusionTest.computeFusionQualityNoise(org.deckfour.xes.model.XLog log,
Tree<RepEGraph> hierarchy,
PGraphFilter<ENode> eventFilter) |
Modifier and Type | Method and Description |
---|---|
PGraphFilter<ENode> |
PGraphController.getENodeFilter() |
PGraphFilter<ENode> |
PGraphParameter.getNodeFilter() |
Modifier and Type | Method and Description |
---|---|
void |
PGraphController.addNodeFiltering(PGraphFilter<ENode> nodeFilter) |
void |
PGraphParameter.setNodeFilter(PGraphFilter<ENode> eventfreqFilter) |
Modifier and Type | Method and Description |
---|---|
boolean |
PGraphFilterEventFreqImpl.isSatisfied(ENode object) |
boolean |
PGraphFilterEventFreqSingleGraphImpl.isSatisfied(ENode object) |
boolean |
PGraphFilterLabelAEventFreqImpl.isSatisfied(ENode object) |
boolean |
PGraphFilterLabelAEventFreqSingleGraphImpl.isSatisfied(ENode object) |