SDDE compares the evolution of an original network X to an augmented network Y by counting the number of shortcuts, detours, dead ends, equal paths and disconnected nodes.
Four different types of paths in Y that pass by at least one augmented node (i.e. a node that exists in Y but not in X) can be defined as follows:
1) Shortcut is a path between two nodes, originally present in X, that is shorter in Y than in X.
2) Detour is a path such that it connects two nodes originally present in X and is longer in Y than in X.
3) Dead End is a path that exists in X, but is impossible in Y.
4) Equal is a path that has the same length in X an Y.
The numbers of disconnected nodes is also reported.
|Maintainer:||Etienne Lord <firstname.lastname@example.org>,|
|François-Joseph Lapointe <email@example.com>|
complete_network computes the number of paths in each category.
complete_restart is similar to the
complete_network function but it identifies the paths in a predefined order.
complete_trace is similar to the
complete_network function but allow the enumeration of nodes and taxa in a path.
sample_network computes the number of paths in each category for a given set of nodes of the original network X.
random_network creates a random network X and an augmented network Y using Erdos-Renyi or Barabási–Albert models.
save_network and codeplot_network creates rendering of network X and network Y in various file formats (svg, png and eps).
load_network loads a network from a list of edges (tab-separated) which is compatible with the
Etienne Lord, Margaux Le Cam, Éric Bapteste, Vladimir Makarenkov and François-Joseph Lapointe