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
|
% Generated by roxygen2: do not edit by hand
% Please edit documentation in R/data_frame.R
\name{graph_from_edgelist}
\alias{graph_from_edgelist}
\alias{from_edgelist}
\title{Create a graph from an edge list matrix}
\usage{
graph_from_edgelist(el, directed = TRUE)
from_edgelist(...)
}
\arguments{
\item{el}{The edge list, a two column matrix, character or numeric.}
\item{directed}{Whether to create a directed graph.}
\item{...}{Passed to \code{graph_from_edgelist()}.}
}
\value{
An igraph graph.
}
\description{
\code{graph_from_edgelist()} creates a graph from an edge list. Its argument
is a two-column matrix, each row defines one edge. If it is
a numeric matrix then its elements are interpreted as vertex ids. If
it is a character matrix then it is interpreted as symbolic vertex
names and a vertex id will be assigned to each name, and also a
\code{name} vertex attribute will be added.
}
\examples{
el <- matrix(c("foo", "bar", "bar", "foobar"), nc = 2, byrow = TRUE)
graph_from_edgelist(el)
# Create a ring by hand
graph_from_edgelist(cbind(1:10, c(2:10, 1)))
}
\seealso{
Other deterministic constructors:
\code{\link{graph_from_atlas}()},
\code{\link{graph_from_literal}()},
\code{\link{make_}()},
\code{\link{make_chordal_ring}()},
\code{\link{make_empty_graph}()},
\code{\link{make_full_citation_graph}()},
\code{\link{make_full_graph}()},
\code{\link{make_graph}()},
\code{\link{make_lattice}()},
\code{\link{make_ring}()},
\code{\link{make_star}()},
\code{\link{make_tree}()}
}
\concept{Edge list}
\concept{deterministic constructors}
|
