internal

Network sparsification with a variety of novel and known network sparsification
techniques. All network sparsification techniques reduce the number of edges, not the number
of nodes. Network sparsification is sometimes referred to as network dimensionality reduction.
This package is based on the work of Spielman, D., Srivastava, N. (2009)<arXiv:0803.0929>.
Koutis I., Levin, A., Peng, R. (2013)<arXiv:1209.5821>. Toivonen, H., Mahler, S., Zhou, F.
(2010)<doi:10.1007>. Foti, N., Hughes, J., Rockmore, D. (2011)<doi:10.1371>.

Alexander Mercier

simplifyNet

Network Sparsification

Andrew Kramer

Shubhankar Tripathi

Tomlin Pulliam

John Drake

DFS function

<dl><dt>Adj</dt>
<dd>Adjacency matrix.</dd>
<dt>v</dt>
<dd>Node to perform DFS from.</dd>
<dt>discovered</dt>
<dd>A list of discovered nodes from <code>v</code>. If initializing the search, should be all FALSE.</dd></dl>

Arguments

Andrew Kramer
Alexander Mercier

Author

Depth First search — DFS

<dl>

<dt>Adj</dt>
<dd>Adjacency matrix.</dd>


<dt>v</dt>
<dd>Node to perform DFS from.</dd>


<dt>discovered</dt>
<dd>A list of discovered nodes from <code>v</code>. If initializing the search, should be all FALSE.</dd>

</dl>

DFS: Depth First search

Description

Usage

Value

Arguments

Author

Details