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
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
|
% Generated by roxygen2: do not edit by hand
% Please edit documentation in R/interface.R
\name{add_vertices}
\alias{add_vertices}
\title{Add vertices to a graph}
\usage{
add_vertices(graph, nv, ..., attr = list())
}
\arguments{
\item{graph}{The input graph.}
\item{nv}{The number of vertices to add.}
\item{...}{Additional arguments, they must be named,
and they will be added as vertex attributes, for the newly added
vertices. See also details below.}
\item{attr}{A named list, its elements will be added
as vertex attributes, for the newly added vertices. See also details
below.}
}
\value{
The graph, with the vertices (and attributes) added.
}
\description{
If attributes are supplied, and they are not present in the graph,
their values for the original vertices of the graph are set to
\code{NA}.
}
\examples{
g <- make_empty_graph() \%>\%
add_vertices(3, color = "red") \%>\%
add_vertices(2, color = "green") \%>\%
add_edges(c(
1, 2,
2, 3,
3, 4,
4, 5
))
g
V(g)[[]]
plot(g)
}
\seealso{
Other functions for manipulating graph structure:
\code{\link{+.igraph}()},
\code{\link{add_edges}()},
\code{\link{complementer}()},
\code{\link{compose}()},
\code{\link{connect}()},
\code{\link{contract}()},
\code{\link{delete_edges}()},
\code{\link{delete_vertices}()},
\code{\link{difference}()},
\code{\link{difference.igraph}()},
\code{\link{disjoint_union}()},
\code{\link{edge}()},
\code{\link{igraph-minus}},
\code{\link{intersection}()},
\code{\link{intersection.igraph}()},
\code{\link{path}()},
\code{\link{permute}()},
\code{\link{rep.igraph}()},
\code{\link{reverse_edges}()},
\code{\link{simplify}()},
\code{\link{union}()},
\code{\link{union.igraph}()},
\code{\link{vertex}()}
}
\concept{functions for manipulating graph structure}
|
