adj_to_edgelist

Converts an adjacency matrix to edgelist and edgeweight using the
<code>igraph</code> package.

internal

Assortativity coefficients, centrality measures,
and clustering coefficients for weighted and directed networks.
Rewiring unweighted networks with given assortativity coefficients.
Generating general preferential attachment networks.

Yelie Yuan

wdnet

Weighted and Directed Networks

Tiandong Wang

Jun Yan

Panpan Zhang

adj_to_edgelist function

<dl><dt>adj</dt>
<dd>Adjacency matrix of a network.</dd>
<dt>directed</dt>
<dd>Logical, whether the network is directed. This value is
passed to <code><a href="/link/igraph%3A%3Agraph_from_adjacency_matrix()?package=wdnet&version=1.2.3" data-mini-rdoc="wdnet::igraph::graph_from_adjacency_matrix()">igraph::graph_from_adjacency_matrix()</a></code>.</dd>
<dt>weighted</dt>
<dd>Logical, whether the network is weighted.</dd></dl>

Arguments

Converts an adjacency matrix to edgelist and edgeweight using the
igraph package. — adj_to_edgelist

<dl>

<dt>adj</dt>
<dd>Adjacency matrix of a network.</dd>


<dt>directed</dt>
<dd>Logical, whether the network is directed. This value is
passed to <code><a href='https://rdrr.io/pkg/igraph/man/graph_from_adjacency_matrix.html'>igraph::graph_from_adjacency_matrix()</a></code>.</dd>


<dt>weighted</dt>
<dd>Logical, whether the network is weighted.</dd>

</dl>

adj_to_edgelist: Converts an adjacency matrix to edgelist and edgeweight using the `igraph` package.

Description

Usage

Value

Arguments