File: as_edgelist.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 (38 lines) | stat: -rw-r--r-- 884 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
% Generated by roxygen2 (4.1.1): do not edit by hand
% Please edit documentation in R/conversion.R
\name{as_edgelist}
\alias{as_edgelist}
\alias{get.edgelist}
\title{Convert a graph to an edge list}
\usage{
as_edgelist(graph, names = TRUE)
}
\arguments{
\item{graph}{The graph to convert.}

\item{names}{Whether to return a character matrix containing vertex
names (ie. the \code{name} vertex attribute) if they exist or numeric
vertex ids.}
}
\value{
A \code{gsize(graph)} by 2 numeric matrix.
}
\description{
Sometimes it is useful to work with a standard representation of a
graph, like an edge list.
}
\details{
\code{as_edgelist} returns the list of edges in a graph.
}
\examples{
g <- sample_gnp(10, 2/10)
as_edgelist(g)

V(g)$name <- LETTERS[seq_len(gorder(g))]
as_edgelist(g)
}
\seealso{
\code{\link{graph_from_adjacency_matrix}}, \code{\link{read_graph}}
}
\keyword{graphs}