File: is_named.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 (44 lines) | stat: -rw-r--r-- 1,150 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
% Generated by roxygen2 (4.1.1): do not edit by hand
% Please edit documentation in R/attributes.R
\name{is_named}
\alias{is.named}
\alias{is_named}
\title{Named graphs}
\usage{
is_named(graph)
}
\arguments{
\item{graph}{The input graph.}
}
\value{
A logical scalar.
}
\description{
An igraph graph is named, if there is a symbolic name associated with its
vertices.
}
\details{
In igraph vertices can always be identified and specified via their numeric
vertex ids. This is, however, not always convenient, and in many cases there
exist symbolic ids that correspond to the vertices. To allow this more
flexible identification of vertices, one can assign a vertex attribute
called \sQuote{name} to an igraph graph. After doing this, the symbolic
vertex names can be used in all igraph functions, instead of the numeric
ids.

Note that the uniqueness of vertex names are currently not enforced in
igraph, you have to check that for yourself, when assigning the vertex
names.
}
\examples{
g <- make_ring(10)
is_named(g)
V(g)$name <- letters[1:10]
is_named(g)
neighbors(g, "a")
}
\author{
Gabor Csardi \email{csardi.gabor@gmail.com}
}
\keyword{graphs}