From 3aee2fd43e3059a699af2b63c6f2395e5a55e515 Mon Sep 17 00:00:00 2001
From: KatolaZ <katolaz@freaknet.org>
Date: Wed, 27 Sep 2017 15:06:31 +0100
Subject: First commit on github -- NetBunch 1.0

---
 doc/bet_dependency.1 | 81 ++++++++++++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 81 insertions(+)
 create mode 100644 doc/bet_dependency.1

(limited to 'doc/bet_dependency.1')

diff --git a/doc/bet_dependency.1 b/doc/bet_dependency.1
new file mode 100644
index 0000000..9d65834
--- /dev/null
+++ b/doc/bet_dependency.1
@@ -0,0 +1,81 @@
+.\" generated with Ronn/v0.7.3
+.\" http://github.com/rtomayko/ronn/tree/0.7.3
+.
+.TH "BET_DEPENDENCY" "1" "September 2017" "www.complex-networks.net" "www.complex-networks.net"
+.
+.SH "NAME"
+\fBbet_dependency\fR \- Compute the betweenness dependency of nodes
+.
+.SH "SYNOPSIS"
+\fBbet_dependency\fR \fIgraph_in\fR [ \fInode_start\fR [\fInode_end\fR]]
+.
+.SH "DESCRIPTION"
+\fBbet_dependency\fR 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 [\fInode_start\fR, \fInode_end\fR]\. If \fInode_end\fR is not given, the last label of the graph is assumed\. If \fInode_start\fR is not given, use the shortest paths originating from all the nodes of the graph\.
+.
+.SH "PARAMETERS"
+.
+.TP
+\fIgraph_in\fR
+input graph (edge list) if equal to \fB\-\fR (dash), read the edge list from STDIN\.
+.
+.TP
+\fInode_start\fR
+The label of the first node in a sequence of nodes\.
+.
+.TP
+\fInode_end\fR
+The label of the last node in a sequence of nodes\.
+.
+.SH "OUTPUT"
+\fBbet_dependency\fR prints on the standard output (STDOUT) the betweenness dependency score of all the nodes, starting from the node with label 0, one per line\.
+.
+.SH "EXAMPLES"
+The following command:
+.
+.IP "" 4
+.
+.nf
+
+      $ bet_dependency er_1000_5000\.txt
+.
+.fi
+.
+.IP "" 0
+.
+.P
+computes the betweenness dependency of all the nodes of the graph \fBer_1000_5000\.txt\fR, using all the shortest paths, and prints the result on the standard output (STOUT)\.
+.
+.P
+The command:
+.
+.IP "" 4
+.
+.nf
+
+    $ bet_dependency er_1000_5000\.txt 100 200 >node_bet_dep
+.
+.fi
+.
+.IP "" 0
+.
+.P
+will compute the betweenness dependency of the nodes in the graph \fBer_1000_5000\.txt\fR, 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 \fBnode_bet_dep\fR\.
+.
+.SH "SEE ALSO"
+betweenness(1), shortest(1)
+.
+.SH "REFERENCES"
+.
+.IP "\(bu" 4
+U\. Brandes\. "A Faster Algorithm for Betweenness Centrality"\. J\. Math\. Sociol\. 25 (2001), 163\-177\.
+.
+.IP "\(bu" 4
+V\. Latora, V\. Nicosia, G\. Russo, "Complex Networks: Principles, Methods and Applications", Chapter 6, Cambridge University Press (2017)
+.
+.IP "\(bu" 4
+V\. Latora, V\. Nicosia, G\. Russo, "Complex Networks: Principles, Methods and Applications", Appendix 7, Cambridge University Press (2017)
+.
+.IP "" 0
+.
+.SH "AUTHORS"
+(c) Vincenzo \'KatolaZ\' Nicosia 2009\-2017 \fB<v\.nicosia@qmul\.ac\.uk>\fR\.
-- 
cgit v1.2.3