Class GraphEditDistanceSimilarityPlugin


  • public class GraphEditDistanceSimilarityPlugin
    extends java.lang.Object
    Calculates the Graph Edit Distance Similarity between two directed graphs, using default settings. This is a ported version of ProM5 code. The code is not really clean yet I *have the feeling* the greedy algorithm fits its purpose. If at some point someone feels like re-implementing the code, that would be very convenient, time-wise, that is currently not interesting for me (svzelst).
    • Constructor Detail

      • GraphEditDistanceSimilarityPlugin

        public GraphEditDistanceSimilarityPlugin()
    • Method Detail

      • calculatePetrinetDefaultAB

        public static java.lang.Double calculatePetrinetDefaultAB​(org.processmining.contexts.uitopia.UIPluginContext context,
                                                                  Petrinet modelA,
                                                                  Petrinet modelB)
      • calculatePetrinetDefaultAB

        public static java.lang.Double calculatePetrinetDefaultAB​(org.processmining.framework.plugin.PluginContext context,
                                                                  Petrinet modelA,
                                                                  Petrinet modelB)