Open szhorvat opened 2 weeks ago
Many examples still use graph.isomorphic. These should be replaced by isomorphic.
graph.isomorphic
isomorphic
$ rg graph.isomorphic foreign.R 550:#' @seealso [read_graph()], [graph.isomorphic.vf2()] 563:#' graph.isomorphic.vf2(g, g2) \% should be TRUE conversion.R 1118:#' graph.isomorphic(g, g2) 1124:#' graph.isomorphic(g, g2) topology.R 332:#' @aliases graph.isomorphic graph.isomorphic.34 graph.isomorphic.vf2 333:#' @aliases graph.isomorphic.bliss 385: .Call(R_igraph_isomorphic, graph1, graph2) 388: .Call(R_igraph_isomorphic, graph1, graph2) 390: graph.isomorphic.vf2(graph1, graph2, ...)$iso 392: graph.isomorphic.bliss(graph1, graph2, ...)$iso 397:#' @cdocs igraph_isomorphic_bliss 398:graph.isomorphic.bliss <- isomorphic_bliss_impl 400:#' @cdocs igraph_isomorphic_vf2 401:graph.isomorphic.vf2 <- isomorphic_vf2_impl 411:#' Decide if a graph is subgraph isomorphic to another one 498:#' subgraph_isomorphic(pattern, dring) 499:subgraph_isomorphic <- function(pattern, target, 517:#' @rdname subgraph_isomorphic 518:is_subgraph_isomorphic_to <- subgraph_isomorphic 832:#' [graph.isomorphic()] for deciding graph isomorphism, possibly 887:#' graph.isomorphic(g, g2) 894:#' graph.isomorphic(g, g2) 905:#' @cdocs igraph_isomorphic 906:graph.isomorphic <- isomorphic_impl bipartite.R 121:#' graph.isomorphic(proj[[1]], make_full_graph(10)) 122:#' graph.isomorphic(proj[[2]], make_full_graph(5)) operators.R 688:#' graph.isomorphic(gu, make_full_graph(vcount(g))) aaa-auto.R 3031: res <- .Call(R_igraph_isomorphic, graph1, graph2) 3096: res <- .Call(R_igraph_isomorphic_vf2, graph1, graph2, vertex.color1, vertex.color2, edge.color1, edge.color2) 3331: res <- .Call(R_igraph_isomorphic_bliss, graph1, graph2, colors1, colors2, sh) ~/R/r/R (main|✔) $ rg graph\\.isomorphic foreign.R 550:#' @seealso [read_graph()], [graph.isomorphic.vf2()] 563:#' graph.isomorphic.vf2(g, g2) \% should be TRUE topology.R 332:#' @aliases graph.isomorphic graph.isomorphic.34 graph.isomorphic.vf2 333:#' @aliases graph.isomorphic.bliss 390: graph.isomorphic.vf2(graph1, graph2, ...)$iso 392: graph.isomorphic.bliss(graph1, graph2, ...)$iso 398:graph.isomorphic.bliss <- isomorphic_bliss_impl 401:graph.isomorphic.vf2 <- isomorphic_vf2_impl 832:#' [graph.isomorphic()] for deciding graph isomorphism, possibly 887:#' graph.isomorphic(g, g2) 894:#' graph.isomorphic(g, g2) 906:graph.isomorphic <- isomorphic_impl bipartite.R 121:#' graph.isomorphic(proj[[1]], make_full_graph(10)) 122:#' graph.isomorphic(proj[[2]], make_full_graph(5)) conversion.R 1118:#' graph.isomorphic(g, g2) 1124:#' graph.isomorphic(g, g2) operators.R 688:#' graph.isomorphic(gu, make_full_graph(vcount(g)))
Many examples still use
graph.isomorphic
. These should be replaced byisomorphic
.