File: is.mutual.Rd

package info (click to toggle)
r-cran-igraph 2.1.4-1
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid, trixie
  • size: 27,044 kB
  • sloc: ansic: 204,981; cpp: 21,711; fortran: 4,090; yacc: 1,229; lex: 519; sh: 52; makefile: 8
file content (23 lines) | stat: -rw-r--r-- 778 bytes parent folder | download
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
% Generated by roxygen2: do not edit by hand
% Please edit documentation in R/structural.properties.R
\name{is.mutual}
\alias{is.mutual}
\title{Find mutual edges in a directed graph}
\usage{
is.mutual(graph, eids = E(graph), loops = TRUE)
}
\arguments{
\item{graph}{The input graph.}

\item{eids}{Edge sequence, the edges that will be probed. By default is
includes all edges in the order of their ids.}

\item{loops}{Logical, whether to consider directed self-loops to be mutual.}
}
\description{
\ifelse{html}{\href{https://lifecycle.r-lib.org/articles/stages.html#deprecated}{\figure{lifecycle-deprecated.svg}{options: alt='[Deprecated]'}}}{\strong{[Deprecated]}}

\code{is.mutual()} was renamed to \code{which_mutual()} to create a more
consistent API.
}
\keyword{internal}