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
|
% Generated by roxygen2: do not edit by hand
% Please edit documentation in R/decomposition.R
\name{is.chordal}
\alias{is.chordal}
\title{Chordality of a graph}
\usage{
is.chordal(
graph,
alpha = NULL,
alpham1 = NULL,
fillin = FALSE,
newgraph = FALSE
)
}
\arguments{
\item{graph}{The input graph. It may be directed, but edge directions are
ignored, as the algorithm is defined for undirected graphs.}
\item{alpha}{Numeric vector, the maximal chardinality ordering of the
vertices. If it is \code{NULL}, then it is automatically calculated by
calling \code{\link[=max_cardinality]{max_cardinality()}}, or from \code{alpham1} if
that is given..}
\item{alpham1}{Numeric vector, the inverse of \code{alpha}. If it is
\code{NULL}, then it is automatically calculated by calling
\code{\link[=max_cardinality]{max_cardinality()}}, or from \code{alpha}.}
\item{fillin}{Logical scalar, whether to calculate the fill-in edges.}
\item{newgraph}{Logical scalar, whether to calculate the triangulated graph.}
}
\description{
\ifelse{html}{\href{https://lifecycle.r-lib.org/articles/stages.html#deprecated}{\figure{lifecycle-deprecated.svg}{options: alt='[Deprecated]'}}}{\strong{[Deprecated]}}
\code{is.chordal()} was renamed to \code{is_chordal()} to create a more
consistent API.
}
\keyword{internal}
|
