File: complementer.Rd

package info (click to toggle)
r-cran-igraph 1.0.1-1%2Bdeb9u1
  • links: PTS, VCS
  • area: main
  • in suites: stretch
  • size: 18,232 kB
  • sloc: ansic: 173,538; cpp: 19,365; fortran: 4,550; yacc: 1,164; tcl: 931; lex: 484; makefile: 149; sh: 9
file content (46 lines) | stat: -rw-r--r-- 1,082 bytes parent folder | download | duplicates (2)
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
33
34
35
36
37
38
39
40
41
42
43
44
45
46
% Generated by roxygen2 (4.1.1): do not edit by hand
% Please edit documentation in R/operators.R
\name{complementer}
\alias{complementer}
\alias{graph.complementer}
\title{Complementer of a graph}
\usage{
complementer(graph, loops = FALSE)
}
\arguments{
\item{graph}{The input graph, can be directed or undirected.}

\item{loops}{Logical constant, whether to generate loop edges.}
}
\value{
A new graph object.
}
\description{
A complementer graph contains all edges that were not present in the input
graph.
}
\details{
\code{complementer} creates the complementer of a graph. Only edges
which are \emph{not} present in the original graph will be included in the
new graph.

\code{complementer} keeps graph and vertex attriubutes, edge
attributes are lost.
}
\examples{
## Complementer of a ring
g <- make_ring(10)
complementer(g)

## A graph and its complementer give together the full graph
g <- make_ring(10)
gc <- complementer(g)
gu <- union(g, gc)
gu
graph.isomorphic(gu, make_full_graph(vcount(g)))
}
\author{
Gabor Csardi \email{csardi.gabor@gmail.com}
}
\keyword{graphs}