graphMatch_summary: Summary methods for graphMatch objects

In dpmcsuss/iGraphMatch: Tools for Graph Matching

Summary methods for graphMatch objects

Description

Summary methods for graphMatch objects

Usage

## S4 method for signature 'graphMatch'
summary(object, A = NULL, B = NULL, true_label = NULL, directed = NULL)

Arguments

object	graphMatch object
A	igraph or matrix-like object
B	igraph or matrix-like object
true_label	the true correspondence (if available)
directed	whether to treat the graphs as directed (TRUE) or not directed (FALSE) default is NULL which will treat the graphs as directed if either adjacency matrix is not symmetric.

Value

summary returns the graph matching formula, and a summary of graph matching results including the number of matches, the number of correct matches (if the true correspondence is available), and common edges, missing edges, extra edges, common non-edges and the objective function value.

Examples

set.seed(123)
graphs <- sample_correlated_gnp_pair(20, .9, .3)
A <- graphs$graph1
B <- graphs$graph2
match <- gm(A, B, 1:4, method = "percolation")

summary(match, A, B)
summary(match, A, B, true_label = 1:20) # also output the number of correct matches

dpmcsuss/iGraphMatch documentation built on May 22, 2024, 8:52 p.m.