diff options
| author | KatolaZ <katolaz@freaknet.org> | 2017-09-28 07:36:24 +0100 |
|---|---|---|
| committer | KatolaZ <katolaz@freaknet.org> | 2017-09-28 07:36:24 +0100 |
| commit | ff6073838e23eca46119cffac7855fddea3ef48f (patch) | |
| tree | c4a4b645d2d39d239bff75e6093507b42694c695 /doc/shortest_avg_max_hist.1 | |
| parent | bc509a2a17de7b853167a774fcf73ef0f345aa3d (diff) | |
Added "debian/" directory for deb packages
Diffstat (limited to 'doc/shortest_avg_max_hist.1')
| -rw-r--r-- | doc/shortest_avg_max_hist.1 | 2 |
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" . |