Given the adjacency matrix for a network return a data.frame listing all possible edges and the weights for each edge.
data.frame, see 'Details' for formatting assumptions.
logical, If TRUE, the returned igraph is directed.
This assumes that
elist is a data.frame with three
columns. Each row is an edge in the network. The first
column lists the node the edge is coming from, the second
column lists the node the edge is going to, and the third
column lists the weight of the edge.
igraph, If the edgelist third column has values other than 0, 1 then the weights are stored in E(returned graph)$weight.
Stephen R. Haptonstahl firstname.lastname@example.org
1 2 3 4 5
Loading required package: igraph Attaching package: 'igraph' The following objects are masked from 'package:stats': decompose, spectrum The following object is masked from 'package:base': union Loading required package: Rcpp [,1] [,2] [1,] 1 1 [2,] 1 2 [3,] 2 1 [4,] 2 2  0.8669050 0.5712371 0.5928074 0.5292011
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.