1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
|
% Generated by roxygen2: do not edit by hand
% Please edit documentation in R/iterators.R
\name{identical_graphs}
\alias{identical_graphs}
\title{Decide if two graphs are identical}
\usage{
identical_graphs(g1, g2, attrs = TRUE)
}
\arguments{
\item{g1, g2}{The two graphs}
\item{attrs}{Whether to compare the attributes of the graphs}
}
\value{
Logical scalar
}
\description{
Two graphs are considered identical by this function if and only if
they are represented in exactly the same way in the internal R
representation. This means that the two graphs must have the same
list of vertices and edges, in exactly the same order, with same
directedness, and the two graphs must also have identical graph, vertex and
edge attributes.
}
\details{
This is similar to \code{identical} in the \code{base} package,
but it ignores the mutable piece of igraph objects; those might be
different even if the two graphs are identical.
Attribute comparison can be turned off with the \code{attrs} parameter if
the attributes of the two graphs are allowed to be different.
}
|
