From ff6073838e23eca46119cffac7855fddea3ef48f Mon Sep 17 00:00:00 2001
From: KatolaZ bb_fitness(1), dms(1), bbv(1)ba_10000_3_5.txt
(thanks to the redirection operator >
SEE ALSO
-
+REFERENCES
diff --git a/doc/bb_fitness.1.html b/doc/bb_fitness.1.html
index dbac594..ed7b162 100644
--- a/doc/bb_fitness.1.html
+++ b/doc/bb_fitness.1.html
@@ -137,7 +137,7 @@ specified file).
ba(1), dms(1)
bbv_10000_3_5_1.0_0.5.txt
ba(1), bb_fitness(1), dms(1)
node_bet_dep
.
betweenness(1), shortest(1)
bet_dependency(1), shortest(1)
+bet_dependency(1), shortest(1)
clust_w(1)
node_clust_w
(notice the syntax
clust(1)
karate_cnm_trace
.
modularity(1), gn(1), label_prop(1)
+modularity(1), gn(1), label_prop(1)
strong_conn(1), node_components(1), largest_component(1)
+strong_conn(1), node_components(1), largest_component(1)
Let us assume that the file pl_-3.0_3_500_10000
contains a power-law
degree sequence ('gamma=-3.0', 'k_min=3', 'k_max=500', 'N=10000'), for
-instance created using power_law(1). We can sample a
+instance created using [power_law(1)][power_law(1)]. We can sample a
simple configuration model graph having that degree sequence using:
$ conf_model_deg pl_-3.0_3_500_10000 > conf_model_-3.0_3_500_10000.net
@@ -160,7 +160,7 @@ stubs will remain unmatched, meaning that the resulting graph has
SEE ALSO
-deg_seq(1), conf_model_deg_nocheck(1), power_law(1), hv_net(1)
+deg_seq(1), conf_model_deg_nocheck(1), power_law(1), hv_net(1)
REFERENCES
diff --git a/doc/conf_model_deg_nocheck.1.html b/doc/conf_model_deg_nocheck.1.html
index 5768cdb..3b3001f 100644
--- a/doc/conf_model_deg_nocheck.1.html
+++ b/doc/conf_model_deg_nocheck.1.html
@@ -122,7 +122,7 @@ always finds a multigraph:
SEE ALSO
-conf_model_deg(1), power_law(1), hv_net(1)
+conf_model_deg(1), power_law(1), hv_net(1)
REFERENCES
diff --git a/doc/deg_seq.1.html b/doc/deg_seq.1.html
index a38cd4e..5726029 100644
--- a/doc/deg_seq.1.html
+++ b/doc/deg_seq.1.html
@@ -111,7 +111,7 @@ format:
SEE ALSO
-deg_seq_w(1), conf_model_deg(1), fitmle(1), power_law(1)
+deg_seq_w(1), conf_model_deg(1), fitmle(1), power_law(1)
REFERENCES
diff --git a/doc/deg_seq_w.1.html b/doc/deg_seq_w.1.html
index fed3819..46eb69a 100644
--- a/doc/deg_seq_w.1.html
+++ b/doc/deg_seq_w.1.html
@@ -111,7 +111,7 @@
SEE ALSO
-deg_seq(1), conf_model_deg(1), fitmle(1), power_law(1)
+deg_seq(1), conf_model_deg(1), fitmle(1), power_law(1)
REFERENCES
diff --git a/doc/dijkstra.1.html b/doc/dijkstra.1.html
index 966a443..f1601c9 100644
--- a/doc/dijkstra.1.html
+++ b/doc/dijkstra.1.html
@@ -126,7 +126,7 @@ network).
SEE ALSO
-
+shortest(1)
REFERENCES
diff --git a/doc/dms.1.html b/doc/dms.1.html
index e51aa79..2831685 100644
--- a/doc/dms.1.html
+++ b/doc/dms.1.html
@@ -144,13 +144,13 @@ graph will be:
creates m=3 new edges and the initial seed network is a ring of
n0=5 nodes. The degree distribution of the final graph will have
exponent equal to gamma = 3.0 + a/m = 3.0
. In this case, dms
-produces a Barabasi-Albert graph (see ba(1) for details). The edge
+produces a Barabasi-Albert graph (see ba(1) for details). The edge
list of the graph is saved in the file dms_10000_3_5_0.txt
(thanks
to the redirection operator >
).
SEE ALSO
-
+ba(1), bb_fitness(1)
REFERENCES
diff --git a/doc/er_A.1.html b/doc/er_A.1.html
index 93c9a11..57c40d9 100644
--- a/doc/er_A.1.html
+++ b/doc/er_A.1.html
@@ -124,7 +124,7 @@ file.
SEE ALSO
-
+er_B(1), ws(1)
REFERENCES
diff --git a/doc/er_B.1.html b/doc/er_B.1.html
index 4b7a963..0917b8f 100644
--- a/doc/er_B.1.html
+++ b/doc/er_B.1.html
@@ -124,7 +124,7 @@ redirect the output of the program to a file.
SEE ALSO
-
+er_A(1), ws(1)
REFERENCES
diff --git a/doc/f3m.1.html b/doc/f3m.1.html
index 3890394..21e6722 100644
--- a/doc/f3m.1.html
+++ b/doc/f3m.1.html
@@ -201,7 +201,7 @@ underrepresented, as made evident by value of the z-score (-3.338).
SEE ALSO
-
+johnson_cycles(1)
REFERENCES
diff --git a/doc/fitmle.1.html b/doc/fitmle.1.html
index 863099c..b99bc9f 100644
--- a/doc/fitmle.1.html
+++ b/doc/fitmle.1.html
@@ -186,7 +186,7 @@ and a much higher p-value:
SEE ALSO
-
+deg_seq(1), power_law(1)
REFERENCES
diff --git a/doc/gn.1.html b/doc/gn.1.html
index 0b1c476..319bf3c 100644
--- a/doc/gn.1.html
+++ b/doc/gn.1.html
@@ -169,7 +169,7 @@ file karate_gn_trace
.
SEE ALSO
-modularity(1), cnm(1), label_prop(1)
+modularity(1), cnm(1), label_prop(1)
REFERENCES
diff --git a/doc/graph_info.1.html b/doc/graph_info.1.html
index 5f41f36..5d452b4 100644
--- a/doc/graph_info.1.html
+++ b/doc/graph_info.1.html
@@ -109,7 +109,7 @@ is the average degree, and avg_k2
is the average squared degree of
SEE ALSO
-
+clust(1)
REFERENCES
diff --git a/doc/hv_net.1.html b/doc/hv_net.1.html
index d01545c..7e6284e 100644
--- a/doc/hv_net.1.html
+++ b/doc/hv_net.1.html
@@ -131,7 +131,7 @@ the node in the sampled graph, in the format:
SEE ALSO
-conf_model_deg(1), conf_model_deg_nocheck(1)
+conf_model_deg(1), conf_model_deg_nocheck(1)
REFERENCES
diff --git a/doc/johnson_cycles.1.html b/doc/johnson_cycles.1.html
index 225f95c..4194676 100644
--- a/doc/johnson_cycles.1.html
+++ b/doc/johnson_cycles.1.html
@@ -236,7 +236,7 @@ require exponentially more time.
SEE ALSO
-
+f3m(1), shortest(1)
REFERENCES
diff --git a/doc/knn.1.html b/doc/knn.1.html
index c8ea160..c85f043 100644
--- a/doc/knn.1.html
+++ b/doc/knn.1.html
@@ -212,7 +212,7 @@ knn(k) indicates the presence of assortative correlations.
SEE ALSO
-
+knn_w(1), deg_seq(1)
REFERENCES
diff --git a/doc/knn_w.1.html b/doc/knn_w.1.html
index 7f2a11d..af4cf7a 100644
--- a/doc/knn_w.1.html
+++ b/doc/knn_w.1.html
@@ -193,7 +193,7 @@ width by running:
SEE ALSO
-
+knn(1), deg_seq(1)
REFERENCES
diff --git a/doc/kruskal.1.html b/doc/kruskal.1.html
index c0aeece..179099c 100644
--- a/doc/kruskal.1.html
+++ b/doc/kruskal.1.html
@@ -149,7 +149,7 @@ second parameter:
SEE ALSO
-clust_w(1), dijkstra(1), largest_component(1)
+clust_w(1), dijkstra(1), largest_component(1)
REFERENCES
diff --git a/doc/label_prop.1.html b/doc/label_prop.1.html
index 1e0eb28..6b6ce89 100644
--- a/doc/label_prop.1.html
+++ b/doc/label_prop.1.html
@@ -164,7 +164,7 @@ flips at each epoch in the file karate_label-prop_trace
.
SEE ALSO
-
+modularity(1), gn(1), cnm(1)
REFERENCES
diff --git a/doc/largest_component.1.html b/doc/largest_component.1.html
index 1d0af04..a8a7523 100644
--- a/doc/largest_component.1.html
+++ b/doc/largest_component.1.html
@@ -109,7 +109,7 @@ component of graph_in, in the format:
SEE ALSO
-components(1), node_components(1), strong_conn(1)
+components(1), node_components(1), strong_conn(1)
REFERENCES
diff --git a/doc/node_components.1.html b/doc/node_components.1.html
index cdbf09b..d528de7 100644
--- a/doc/node_components.1.html
+++ b/doc/node_components.1.html
@@ -180,7 +180,7 @@ parameter. IN this case, it is better to save the output of
SEE ALSO
-components(1), strong_conn(1), largest_component(1)
+components(1), strong_conn(1), largest_component(1)
REFERENCES
diff --git a/doc/power_law.1.html b/doc/power_law.1.html
index 7ebae1c..1fdba1e 100644
--- a/doc/power_law.1.html
+++ b/doc/power_law.1.html
@@ -187,7 +187,7 @@ with an odd sum, which thus cannot correspond to a valid degree sequence.
SEE ALSO
-deg_seq(1), conf_model_deg(1), conf_model_deg_nocheck(1)
+deg_seq(1), conf_model_deg(1), conf_model_deg_nocheck(1)
REFERENCES
diff --git a/doc/shortest.1.html b/doc/shortest.1.html
index df962b0..d9bedd2 100644
--- a/doc/shortest.1.html
+++ b/doc/shortest.1.html
@@ -147,7 +147,7 @@ paths will be written to the file er_1000_5000.net_25_paths
.
SEE ALSO
-dijkstra(1), bet_dependency(1), betweenness(1), shortest_avg_max_hist(1)
+dijkstra(1), bet_dependency(1), betweenness(1), shortest_avg_max_hist(1)
REFERENCES
diff --git a/doc/shortest_avg_max_hist.1 b/doc/shortest_avg_max_hist.1
index 8bb8653..34642b0 100644
--- a/doc/shortest_avg_max_hist.1
+++ b/doc/shortest_avg_max_hist.1
@@ -10,7 +10,7 @@
\fBshortest_avg_max_hist\fR \fIgraph_in\fR \fInode\fR
.
.SH "DESCRIPTION"
-\fBshortest_avg_max_hist\fR computes the distance (and the shortest paths) between a given node and all the other nodes of an undirected graph provided as input\. The program implements the Breadth\-First Search algorithm, and works almost exactly as shortest(1) \fIshortest\.1\.html\fR, except for the output\.
+\fBshortest_avg_max_hist\fR computes the distance (and the shortest paths) between a given node and all the other nodes of an undirected graph provided as input\. The program implements the Breadth\-First Search algorithm, and works almost exactly as [shortest(1)][], except for the output\.
.
.SH "PARAMETERS"
.
diff --git a/doc/shortest_avg_max_hist.1.html b/doc/shortest_avg_max_hist.1.html
index 8169b7c..2b94e33 100644
--- a/doc/shortest_avg_max_hist.1.html
+++ b/doc/shortest_avg_max_hist.1.html
@@ -90,7 +90,7 @@
shortest_avg_max_hist
computes the distance (and the shortest paths)
between a given node and all the other nodes of an undirected graph
provided as input. The program implements the Breadth-First Search
-algorithm, and works almost exactly as shortest(1), except for the
+algorithm, and works almost exactly as [shortest(1)][], except for the
output.
PARAMETERS
@@ -122,7 +122,7 @@ nodes in the graph (3.2002
), the eccentricity of node 25SEE ALSO
-shortest(1), betweenness(1), bet_dependency(1)
+shortest(1), betweenness(1), bet_dependency(1)
REFERENCES
diff --git a/doc/strong_conn.1.html b/doc/strong_conn.1.html
index 4b4e0af..f76a467 100644
--- a/doc/strong_conn.1.html
+++ b/doc/strong_conn.1.html
@@ -169,7 +169,7 @@ using:
SEE ALSO
-components(1), node_components(1), largest_component(1)
+components(1), node_components(1), largest_component(1)
REFERENCES
diff --git a/doc/ws.1.html b/doc/ws.1.html
index c3ff511..3a71d5b 100644
--- a/doc/ws.1.html
+++ b/doc/ws.1.html
@@ -145,7 +145,7 @@ edges, since SHOW
was specified as a fourth parameter.
SEE ALSO
-
+er_A(1), er_B(1)
REFERENCES
--
cgit v1.2.3