java.lang.Object
org.graffiti.plugin.algorithm.AbstractAlgorithm
de.ipk_gatersleben.ag_nw.graffiti.plugins.algorithms.hamming_distance.HammingDistanceAlgorithm
All Implemented Interfaces:
UndoableEdit, Algorithm

public class HammingDistanceAlgorithm
extends AbstractAlgorithm
This algorithm computes the hamming distances between directed graphs. The hamming distance is the number of pairwise differences between the graphs, whereas nodes, edges, or both and also edge labels can be considered. It uses the node labels to compare nodes and the labels of nodes connected to the edge to compare edges. Each node may have a distinguishable label.
Author:
Falk Schreiber
  • Constructor Details

    • HammingDistanceAlgorithm

      public HammingDistanceAlgorithm()
  • Method Details