Package org.processmining.petrinets.analysis.gedsim.algorithms.abstr

Class AbstractGraphEditDistanceSimilarityAlgorithm.Mapping

java.lang.Object

org.processmining.petrinets.analysis.gedsim.algorithms.abstr.AbstractGraphEditDistanceSimilarityAlgorithm.Mapping

All Implemented Interfaces:

java.lang.Comparable<AbstractGraphEditDistanceSimilarityAlgorithm.Mapping>

Enclosing class:

AbstractGraphEditDistanceSimilarityAlgorithm<D extends org.processmining.models.graphbased.directed.DirectedGraph<? extends org.processmining.models.graphbased.directed.DirectedGraphNode,? extends org.processmining.models.graphbased.directed.DirectedGraphEdge<?,?>>>

public class AbstractGraphEditDistanceSimilarityAlgorithm.Mapping
extends java.lang.Object
implements java.lang.Comparable<AbstractGraphEditDistanceSimilarityAlgorithm.Mapping>

Field Summary

Fields

Modifier and Type	Field	Description
java.util.Set<org.processmining.framework.util.Pair<org.processmining.models.graphbased.directed.DirectedGraphNode,org.processmining.models.graphbased.directed.DirectedGraphNode>>	addedEdges
java.util.Set<org.processmining.models.graphbased.directed.DirectedGraphNode>	addedVertices
double	cost
java.util.Set<org.processmining.framework.util.Pair<org.processmining.models.graphbased.directed.DirectedGraphNode,org.processmining.models.graphbased.directed.DirectedGraphNode>>	deletedEdges
java.util.Set<org.processmining.models.graphbased.directed.DirectedGraphNode>	deletedVertices
java.util.Map<org.processmining.models.graphbased.directed.DirectedGraphNode,org.processmining.models.graphbased.directed.DirectedGraphNode>	mappingsFromGraph1
java.util.Map<org.processmining.models.graphbased.directed.DirectedGraphNode,org.processmining.models.graphbased.directed.DirectedGraphNode>	mappingsFromGraph2
java.util.Set<org.processmining.framework.util.Pair<org.processmining.models.graphbased.directed.DirectedGraphNode,org.processmining.models.graphbased.directed.DirectedGraphNode>>	matchedEdges
java.util.List<org.processmining.models.graphbased.directed.DirectedGraphNode>	remaining1
java.util.List<org.processmining.models.graphbased.directed.DirectedGraphNode>	remaining2
double	vertexMappingCost
double	vertexMappingCount

Constructor Summary

Constructors

Constructor	Description
Mapping()

Method Summary

Modifier and Type	Method	Description
AbstractGraphEditDistanceSimilarityAlgorithm.Mapping	clone()
int	compareTo(AbstractGraphEditDistanceSimilarityAlgorithm.Mapping o)
double	getCost()
void	step(org.processmining.models.graphbased.directed.DirectedGraphNode v1, org.processmining.models.graphbased.directed.DirectedGraphNode v2)
void	step(org.processmining.models.graphbased.directed.DirectedGraphNode v1, org.processmining.models.graphbased.directed.DirectedGraphNode v2, double subsCost)
void	updateCost(GraphEditDistanceSimilarityAStar edCalculator)

Methods inherited from class java.lang.Object

equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Field Detail

cost

public double cost

vertexMappingCost

public double vertexMappingCost

vertexMappingCount

public double vertexMappingCount

mappingsFromGraph1

public java.util.Map<org.processmining.models.graphbased.directed.DirectedGraphNode,org.processmining.models.graphbased.directed.DirectedGraphNode> mappingsFromGraph1

mappingsFromGraph2

public java.util.Map<org.processmining.models.graphbased.directed.DirectedGraphNode,org.processmining.models.graphbased.directed.DirectedGraphNode> mappingsFromGraph2

addedVertices

public java.util.Set<org.processmining.models.graphbased.directed.DirectedGraphNode> addedVertices

deletedVertices

public java.util.Set<org.processmining.models.graphbased.directed.DirectedGraphNode> deletedVertices

matchedEdges

public java.util.Set<org.processmining.framework.util.Pair<org.processmining.models.graphbased.directed.DirectedGraphNode,org.processmining.models.graphbased.directed.DirectedGraphNode>> matchedEdges

addedEdges

public java.util.Set<org.processmining.framework.util.Pair<org.processmining.models.graphbased.directed.DirectedGraphNode,org.processmining.models.graphbased.directed.DirectedGraphNode>> addedEdges

deletedEdges

public java.util.Set<org.processmining.framework.util.Pair<org.processmining.models.graphbased.directed.DirectedGraphNode,org.processmining.models.graphbased.directed.DirectedGraphNode>> deletedEdges

remaining1

public java.util.List<org.processmining.models.graphbased.directed.DirectedGraphNode> remaining1

remaining2

public java.util.List<org.processmining.models.graphbased.directed.DirectedGraphNode> remaining2

Constructor Detail

Mapping

public Mapping()

Method Detail

clone

public AbstractGraphEditDistanceSimilarityAlgorithm.Mapping clone()

Overrides:

clone in class java.lang.Object

compareTo

public int compareTo(AbstractGraphEditDistanceSimilarityAlgorithm.Mapping o)

Specified by:

compareTo in interface java.lang.Comparable<AbstractGraphEditDistanceSimilarityAlgorithm.Mapping>

getCost

public double getCost()

updateCost

public void updateCost(GraphEditDistanceSimilarityAStar edCalculator)

step

public void step(org.processmining.models.graphbased.directed.DirectedGraphNode v1,
                 org.processmining.models.graphbased.directed.DirectedGraphNode v2)

step

public void step(org.processmining.models.graphbased.directed.DirectedGraphNode v1,
                 org.processmining.models.graphbased.directed.DirectedGraphNode v2,
                 double subsCost)