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
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
|
## ----------------------------------------------------------------
##
## IGraph R package
## Copyright (C) 2005-2014 Gabor Csardi <csardi.gabor@gmail.com>
## 334 Harvard street, Cambridge, MA 02139 USA
##
## This program is free software; you can redistribute it and/or modify
## it under the terms of the GNU General Public License as published by
## the Free Software Foundation; either version 2 of the License, or
## (at your option) any later version.
##
## This program is distributed in the hope that it will be useful,
## but WITHOUT ANY WARRANTY; without even the implied warranty of
## MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
## GNU General Public License for more details.
##
## You should have received a copy of the GNU General Public License
## along with this program; if not, write to the Free Software
## Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
## 02110-1301 USA
##
## -----------------------------------------------------------------
graph.incidence.sparse <- function(incidence, directed, mode, multiple,
weighted) {
n1 <- nrow(incidence)
n2 <- ncol(incidence)
el <- Matrix::summary(incidence)
## el <- summary(incidence)
el[,2] <- el[,2] + n1
if (!is.null(weighted)) {
if (is.logical(weighted) && weighted) {
weighted <- "weight"
}
if (!is.character(weighted)) {
stop("invalid value supplied for `weighted' argument, please see docs.")
}
if (!directed || mode==1) {
## nothing do to
} else if (mode==2) {
el[,1:2] <- el[,c(2,1)]
} else if (mode==3) {
el <- rbind(el, el[,c(2,1,3)])
}
res <- make_empty_graph(n=n1+n2, directed=directed)
weight <- list(el[,3])
names(weight) <- weighted
res <- add_edges(res, edges=t(as.matrix(el[,1:2])), attr=weight)
} else {
if (multiple) {
el[,3] <- ceiling(el[,3])
el[,3][ el[,3] < 0 ] <- 0
} else {
el[,3] <- el[,3] != 0
}
if (!directed || mode==1) {
## nothing do to
} else if (mode==2) {
el[,1:2] <- el[,c(2,1)]
} else if (mode==3) {
el <- rbind(el, el[,c(2,1,3)])
}
edges <- unlist(apply(el, 1, function(x) rep(unname(x[1:2]), x[3])))
res <- graph(n=n1+n2, edges, directed=directed)
}
set_vertex_attr(res, "type", value=c(rep(FALSE, n1), rep(TRUE, n2)))
}
graph.incidence.dense <- function(incidence, directed, mode, multiple,
weighted) {
if (!is.null(weighted)) {
if (is.logical(weighted) && weighted) {
weighted <- "weight"
}
if (!is.character(weighted)) {
stop("invalid value supplied for `weighted' argument, please see docs.")
}
n1 <- nrow(incidence)
n2 <- ncol(incidence)
no.edges <- sum(incidence != 0)
if (directed && mode==3) { no.edges <- no.edges * 2 }
edges <- numeric(2*no.edges)
weight <- numeric(no.edges)
ptr <- 1
for (i in seq_len(nrow(incidence))) {
for (j in seq_len(ncol(incidence))) {
if (incidence[i,j] != 0) {
if (!directed || mode==1) {
edges[2*ptr-1] <- i
edges[2*ptr] <- n1+j
weight[ptr] <- incidence[i,j]
ptr <- ptr + 1
} else if (mode==2) {
edges[2*ptr-1] <- n1+j
edges[2*ptr] <- i
weight[ptr] <- incidence[i,j]
ptr <- ptr + 1
} else if (mode==3) {
edges[2*ptr-1] <- i
edges[2*ptr] <- n1+j
weight[ptr] <- incidence[i,j]
ptr <- ptr + 1
edges[2*ptr-1] <- n1+j
edges[2*ptr] <- i
}
}
}
}
res <- make_empty_graph(n=n1+n2, directed=directed)
weight <- list(weight)
names(weight) <- weighted
res <- add_edges(res, edges, attr=weight)
res <- set_vertex_attr(res, "type",
value=c(rep(FALSE, n1), rep(TRUE, n2)))
} else {
mode(incidence) <- "double"
on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
## Function call
res <- .Call("R_igraph_incidence", incidence, directed, mode, multiple,
PACKAGE="igraph")
res <- set_vertex_attr(res$graph, "type", value=res$types)
}
res
}
#' Create graphs from an incidence matrix
#'
#' \code{graph_from_incidence_matrix} creates a bipartite igraph graph from an incidence
#' matrix.
#'
#' Bipartite graphs have a \sQuote{\code{type}} vertex attribute in igraph,
#' this is boolean and \code{FALSE} for the vertices of the first kind and
#' \code{TRUE} for vertices of the second kind.
#'
#' \code{graph_from_incidence_matrix} can operate in two modes, depending on the
#' \code{multiple} argument. If it is \code{FALSE} then a single edge is
#' created for every non-zero element in the incidence matrix. If
#' \code{multiple} is \code{TRUE}, then the matrix elements are rounded up to
#' the closest non-negative integer to get the number of edges to create
#' between a pair of vertices.
#'
#' @aliases graph.incidence
#' @param incidence The input incidence matrix. It can also be a sparse matrix
#' from the \code{Matrix} package.
#' @param directed Logical scalar, whether to create a directed graph.
#' @param mode A character constant, defines the direction of the edges in
#' directed graphs, ignored for undirected graphs. If \sQuote{\code{out}}, then
#' edges go from vertices of the first kind (corresponding to rows in the
#' incidence matrix) to vertices of the second kind (columns in the incidence
#' matrix). If \sQuote{\code{in}}, then the opposite direction is used. If
#' \sQuote{\code{all}} or \sQuote{\code{total}}, then mutual edges are created.
#' @param multiple Logical scalar, specifies how to interpret the matrix
#' elements. See details below.
#' @param weighted This argument specifies whether to create a weighted graph
#' from the incidence matrix. If it is \code{NULL} then an unweighted graph is
#' created and the \code{multiple} argument is used to determine the edges of
#' the graph. If it is a character constant then for every non-zero matrix
#' entry an edge is created and the value of the entry is added as an edge
#' attribute named by the \code{weighted} argument. If it is \code{TRUE} then a
#' weighted graph is created and the name of the edge attribute will be
#' \sQuote{\code{weight}}.
#' @param add.names A character constant, \code{NA} or \code{NULL}.
#' \code{graph_from_incidence_matrix} can add the row and column names of the incidence
#' matrix as vertex attributes. If this argument is \code{NULL} (the default)
#' and the incidence matrix has both row and column names, then these are added
#' as the \sQuote{\code{name}} vertex attribute. If you want a different vertex
#' attribute for this, then give the name of the attributes as a character
#' string. If this argument is \code{NA}, then no vertex attributes (other than
#' type) will be added.
#' @return A bipartite igraph graph. In other words, an igraph graph that has a
#' vertex attribute \code{type}.
#' @author Gabor Csardi \email{csardi.gabor@@gmail.com}
#' @seealso \code{\link{make_bipartite_graph}} for another way to create bipartite
#' graphs
#' @keywords graphs
#' @examples
#'
#' inc <- matrix(sample(0:1, 15, repl=TRUE), 3, 5)
#' colnames(inc) <- letters[1:5]
#' rownames(inc) <- LETTERS[1:3]
#' graph_from_incidence_matrix(inc)
#'
graph_from_incidence_matrix <- function(incidence, directed=FALSE,
mode=c("all", "out", "in", "total"),
multiple=FALSE, weighted=NULL,
add.names=NULL) {
# Argument checks
directed <- as.logical(directed)
mode <- switch(igraph.match.arg(mode), "out"=1, "in"=2, "all"=3, "total"=3)
multiple <- as.logical(multiple)
if (inherits(incidence, "Matrix")) {
res <- graph.incidence.sparse(incidence, directed=directed,
mode=mode, multiple=multiple,
weighted=weighted)
} else {
incidence <- as.matrix(incidence)
res <- graph.incidence.dense(incidence, directed=directed, mode=mode,
multiple=multiple, weighted=weighted)
}
## Add names
if (is.null(add.names)) {
if (!is.null(rownames(incidence)) && !is.null(colnames(incidence))) {
add.names <- "name"
} else {
add.names <- NA
}
} else if (!is.na(add.names)) {
if (is.null(rownames(incidence)) || is.null(colnames(incidence))) {
warning("Cannot add row- and column names, at least one of them is missing")
add.names <- NA
}
}
if (!is.na(add.names)) {
res <- set_vertex_attr(res, add.names,
value=c(rownames(incidence), colnames(incidence)))
}
res
}
#' @rdname graph_from_incidence_matrix
#' @param ... Passed to \code{graph_from_incidence_matrix}.
#' @export
from_incidence_matrix <- function(...) constructor_spec(graph_from_incidence_matrix, ...)
|
