Computes the Hamming distance between two graph objects.
p x p adjacency matrix of the first graph.
p x p adjacency matrix of the second graph.
boolean variable (TRUE/FALSE) that indicates whether all mistakes should be counted as one. E.g., if it is set to FALSE the Hamming distance between X -> Y and X <- Y is two and one if it set to TRUE.
The Hamming distance between two graphs counts the number of edges, in which the graphs do not coincide. allMistakesOne determines whether a reversed edge counts as two or as one mistake. The Hamming distance is symmetric, that is hammingDist(G1,G2) = hammingDist(G2,G1).
The method outputs the computed Hamming distance.
Jonas Peters <firstname.lastname@example.org>
Want to suggest features or report bugs for rdrr.io? Use the GitHub issue tracker.