mirror of
https://github.com/boostorg/boost.git
synced 2025-04-05 21:45:00 +00:00
Fix handling of overflow in shortest-path algorithms
[SVN r37814]
This commit is contained in:
parent
4e9d8d7671
commit
433848820b
2 changed files with 7 additions and 2 deletions
|
@ -345,6 +345,11 @@
|
|||
<tt>vis.initialize_vertex</tt> for each vertex
|
||||
during initialization.</li>
|
||||
|
||||
<li><a
|
||||
href="libs/graph/doc/bellman_ford_shortest.html"><tt>bellman_ford_shortest_paths</tt></a>:
|
||||
fixed a bug where certain negative
|
||||
cycles were not correctly detected.</li>
|
||||
|
||||
<li><b>Note:</b> the name of the
|
||||
compiled library for the <a
|
||||
href="libs/graph/doc/read_graphviz.html">GraphViz
|
||||
|
@ -354,7 +359,7 @@
|
|||
conventions.</li>
|
||||
|
||||
<li>See the <a href=
|
||||
"libs/graph/doc/history.html#1.34.0">complete
|
||||
"libs/graph/doc/history.html#1.34.1">complete
|
||||
revision history</a> for more information.</li>
|
||||
</ul>
|
||||
</li>
|
||||
|
|
|
@ -1 +1 @@
|
|||
Subproject commit 3125c8577d762674a5002ae25a324dca2a784597
|
||||
Subproject commit 45d0f1331bb9fe5167fd36ee9a25b658eb9c9faa
|
Loading…
Add table
Reference in a new issue