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
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
|
% Generated by roxygen2: do not edit by hand
% Please edit documentation in R/indexing.R
\name{[.igraph}
\alias{[.igraph}
\title{Query and manipulate a graph as it were an adjacency matrix}
\usage{
\method{[}{igraph}(
x,
i,
j,
...,
from,
to,
sparse = igraph_opt("sparsematrices"),
edges = FALSE,
drop = TRUE,
attr = if (is_weighted(x)) "weight" else NULL
)
}
\arguments{
\item{x}{The graph.}
\item{i}{Index. Vertex ids or names or logical vectors. See details
below.}
\item{j}{Index. Vertex ids or names or logical vectors. See details
below.}
\item{...}{Currently ignored.}
\item{from}{A numeric or character vector giving vertex ids or
names. Together with the \code{to} argument, it can be used to
query/set a sequence of edges. See details below. This argument cannot
be present together with any of the \code{i} and \code{j} arguments
and if it is present, then the \code{to} argument must be present as
well.}
\item{to}{A numeric or character vector giving vertex ids or
names. Together with the \code{from} argument, it can be used to
query/set a sequence of edges. See details below. This argument cannot
be present together with any of the \code{i} and \code{j} arguments
and if it is present, then the \code{from} argument must be present as
well.}
\item{sparse}{Logical scalar, whether to return sparse matrices.}
\item{edges}{Logical scalar, whether to return edge ids.}
\item{drop}{Ignored.}
\item{attr}{If not \code{NULL}, then it should be the name of an edge
attribute. This attribute is queried and returned.}
}
\value{
A scalar or matrix. See details below.
}
\description{
Query and manipulate a graph as it were an adjacency matrix
}
\details{
The single bracket indexes the (possibly weighted) adjacency matrix of
the graph. Here is what you can do with it:
\enumerate{
\item Check whether there is an edge between two vertices (\eqn{v}
and \eqn{w}) in the graph: \preformatted{ graph[v, w]}
A numeric scalar is returned, one if the edge exists, zero
otherwise.
\item Extract the (sparse) adjacency matrix of the graph, or part of
it: \preformatted{ graph[]
graph[1:3,5:6]
graph[c(1,3,5),]}
The first variants returns the full adjacency matrix, the other
two return part of it.
\item The \code{from} and \code{to} arguments can be used to check
the existence of many edges. In this case, both \code{from} and
\code{to} must be present and they must have the same length. They
must contain vertex ids or names. A numeric vector is returned, of
the same length as \code{from} and \code{to}, it contains ones
for existing edges edges and zeros for non-existing ones.
Example: \preformatted{ graph[from=1:3, to=c(2,3,5)]}.
\item For weighted graphs, the \code{[} operator returns the edge
weights. For non-esistent edges zero weights are returned. Other
edge attributes can be queried as well, by giving the \code{attr}
argument.
\item Querying edge ids instead of the existance of edges or edge
attributes. E.g. \preformatted{ graph[1, 2, edges=TRUE]}
returns the id of the edge between vertices 1 and 2, or zero if
there is no such edge.
\item Adding one or more edges to a graph. For this the element(s) of
the imaginary adjacency matrix must be set to a non-zero numeric
value (or \code{TRUE}): \preformatted{ graph[1, 2] <- 1
graph[1:3,1] <- 1
graph[from=1:3, to=c(2,3,5)] <- TRUE}
This does not affect edges that are already present in the graph,
i.e. no multiple edges are created.
\item Adding weighted edges to a graph. The \code{attr} argument
contains the name of the edge attribute to set, so it does not
have to be \sQuote{weight}: \preformatted{ graph[1, 2, attr="weight"]<- 5
graph[from=1:3, to=c(2,3,5)] <- c(1,-1,4)}
If an edge is already present in the network, then only its
weights or other attribute are updated. If the graph is already
weighted, then the \code{attr="weight"} setting is implicit, and
one does not need to give it explicitly.
\item Deleting edges. The replacement syntax allow the deletion of
edges, by specifying \code{FALSE} or \code{NULL} as the
replacement value: \preformatted{ graph[v, w] <- FALSE}
removes the edge from vertex \eqn{v} to vertex \eqn{w}.
As this can be used to delete edges between two sets of vertices,
either pairwise: \preformatted{ graph[from=v, to=w] <- FALSE}
or not: \preformatted{ graph[v, w] <- FALSE }
if \eqn{v} and \eqn{w} are vectors of edge ids or names.
}
\sQuote{\code{[}} allows logical indices and negative indices as well,
with the usual R semantics. E.g. \preformatted{ graph[degree(graph)==0, 1] <- 1}
adds an edge from every isolate vertex to vertex one,
and \preformatted{ G <- make_empty_graph(10)
G[-1,1] <- TRUE}
creates a star graph.
Of course, the indexing operators support vertex names,
so instead of a numeric vertex id a vertex can also be given to
\sQuote{\code{[}} and \sQuote{\code{[[}}.
}
\seealso{
Other structural queries:
\code{\link{[[.igraph}()},
\code{\link{adjacent_vertices}()},
\code{\link{are_adjacent}()},
\code{\link{ends}()},
\code{\link{get_edge_ids}()},
\code{\link{gorder}()},
\code{\link{gsize}()},
\code{\link{head_of}()},
\code{\link{incident}()},
\code{\link{incident_edges}()},
\code{\link{is_directed}()},
\code{\link{neighbors}()},
\code{\link{tail_of}()}
}
\concept{structural queries}
|
