summaryrefslogtreecommitdiff
path: root/doc/shortest_avg_max_hist.1
diff options
context:
space:
mode:
Diffstat (limited to 'doc/shortest_avg_max_hist.1')
-rw-r--r--doc/shortest_avg_max_hist.12
1 files changed, 1 insertions, 1 deletions
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"
.