From 3aee2fd43e3059a699af2b63c6f2395e5a55e515 Mon Sep 17 00:00:00 2001 From: KatolaZ Date: Wed, 27 Sep 2017 15:06:31 +0100 Subject: First commit on github -- NetBunch 1.0 --- doc/bet_dependency.1.html | 167 ++++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 167 insertions(+) create mode 100644 doc/bet_dependency.1.html (limited to 'doc/bet_dependency.1.html') diff --git a/doc/bet_dependency.1.html b/doc/bet_dependency.1.html new file mode 100644 index 0000000..e23f9d6 --- /dev/null +++ b/doc/bet_dependency.1.html @@ -0,0 +1,167 @@ + + + + + + bet_dependency(1) - Compute the betweenness dependency of nodes + + + + + +
+ + + +
    +
  1. bet_dependency(1)
    2. +
  2. www.complex-networks.net
    3. +
  3. bet_dependency(1)
    4. +
+ +

NAME

+

+ bet_dependency - Compute the betweenness dependency of nodes +

+ +

SYNOPSIS

+ +

bet_dependency graph_in [ node_start [node_end]]

+ +

DESCRIPTION

+ +

bet_dependency computes the betweenness dependency of all the nodes +of an undirected graph provided as input. The program implements the +algorithm by U. Brandes, and computes the betweenness dependency using +all the shortest paths originating from the subset of the nodes of the +graph whose labels are in the interval [node_start, node_end]. If +node_end is not given, the last label of the graph is assumed. If +node_start is not given, use the shortest paths originating from all +the nodes of the graph.

+ +

PARAMETERS

+ +
+
graph_in

input graph (edge list) if equal to - (dash), read the edge list + from STDIN.

+
node_start

The label of the first node in a sequence of nodes.

+
node_end

The label of the last node in a sequence of nodes.

+
+ + +

OUTPUT

+ +

bet_dependency prints on the standard output (STDOUT) the +betweenness dependency score of all the nodes, starting from the node +with label 0, one per line.

+ +

EXAMPLES

+ +

The following command:

+ +
      $ bet_dependency er_1000_5000.txt 
+
+ +

computes the betweenness dependency of all the nodes of the graph +er_1000_5000.txt, using all the shortest paths, and prints the +result on the standard output (STOUT).

+ +

The command:

+ +
    $ bet_dependency er_1000_5000.txt 100 200 >node_bet_dep
+
+ +

will compute the betweenness dependency of the nodes in the graph +er_1000_5000.txt, based only on the shortest paths originating from +the nodes whose labels are in the range [100,200]. The results will be +saved in the file node_bet_dep.

+ +

SEE ALSO

+ +

betweenness(1), shortest(1)

+ +

REFERENCES

+ + + + +

AUTHORS

+ +

(c) Vincenzo 'KatolaZ' Nicosia 2009-2017 <v.nicosia@qmul.ac.uk>.

+ + +
    +
  1. www.complex-networks.net
    2. +
  2. September 2017
    3. +
  3. bet_dependency(1)
    4. +
+ +
+ + -- cgit v1.2.3