File: adjacent.triangles.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-- 800 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/triangles.R
\name{adjacent.triangles}
\alias{adjacent.triangles}
\title{Find triangles in graphs}
\usage{
adjacent.triangles(graph, vids = V(graph))
}
\arguments{
\item{graph}{The input graph. It might be directed, but edge directions are
ignored.}

\item{vids}{The vertices to query, all of them by default. This might be a
vector of numeric ids, or a character vector of symbolic vertex names for
named graphs.}
}
\description{
\ifelse{html}{\href{https://lifecycle.r-lib.org/articles/stages.html#deprecated}{\figure{lifecycle-deprecated.svg}{options: alt='[Deprecated]'}}}{\strong{[Deprecated]}}

\code{adjacent.triangles()} was renamed to \code{count_triangles()} to create a more
consistent API.
}
\keyword{internal}