diff options
Diffstat (limited to 'doc/shortest_avg_max_hist.1.html')
| -rw-r--r-- | doc/shortest_avg_max_hist.1.html | 4 |
1 files changed, 2 insertions, 2 deletions
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 @@ <p><code>shortest_avg_max_hist</code> 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 <a href="shortest.1.html">shortest(1)</a>, except for the +algorithm, and works almost exactly as [<span class="man-ref">shortest<span class="s">(1)</span></span>][], except for the output.</p> <h2 id="PARAMETERS">PARAMETERS</h2> @@ -122,7 +122,7 @@ nodes in the graph (<code>3.2002</code>), the eccentricity of node <code>25</cod <h2 id="SEE-ALSO">SEE ALSO</h2> -<p><a class="man-ref" href="shortest.1.html">shortest<span class="s">(1)</span></a>, <a class="man-ref" href="betweenness.1.html">betweenness<span class="s">(1)</span></a>, <a class="man-ref" href="bet_dependency.1.html">bet_dependency<span class="s">(1)</span></a></p> +<p><span class="man-ref">shortest<span class="s">(1)</span></span>, <span class="man-ref">betweenness<span class="s">(1)</span></span>, <span class="man-ref">bet_dependency<span class="s">(1)</span></span></p> <h2 id="REFERENCES">REFERENCES</h2> |