Con10                   Matrices of shortest paths corresponding to
                        Erdos-Renyi models for different number of
                        vertices (10, 100 and 1000), which are either
                        connected (e.g. Con10) or disconnected (e.g.
                        Dis10).
NetworkAnalysis-package
                        Statistical inference on populations of
                        weighted or unweighted networks.
adjacency.random        Uniform draw of a random adjacency matrix.
bound.standard          Standardization of bounds when partially
                        integrating topological metrics.
cost.int.metric         Integration of topological metrics for weighted
                        networks.
ge                      The global efficiency of an unweighted simple
                        graph.
maxE                    The number of edges of a saturated (complete)
                        graph.
metric.standardization
                        Standardization of a similarity real-valued
                        matrix.
naCost                  Compute the cost of an unweighted graph.
naDensity               Compute the weighted cost (density) of a
                        weighted graph.
naHeatmap               Produce a heatmap visualization of a
                        (symmetric) matrix
nback1                  Matrix of functional connectivity between 90
                        brain regions.
sym2vec                 Transform a symmetric matrix into a vector.
vec2sym                 Transform a vector into a corresponding
                        symmetric matrix.
