Boost C++ Libraries: Ticket #1700: graph/floyd_warshall_shortest.hpp.patch https://svn.boost.org/trac10/ticket/1700 <p> The "floyd_warshall_dispatch" function sometimes tries to pass in an edge weight of infinity into the "combine" function in line 68, resulting in the wrong computational result if you use the default "combine" function. The correct behavior is to check the edge weights and if either of d[*i][*k] or d[*k][*j] is infinity, to skip the distance matrix update. Attached is the patch. </p> en-us Boost C++ Libraries /htdocs/site/boost.png https://svn.boost.org/trac10/ticket/1700 Trac 1.4.3 eric80@… Thu, 20 Mar 2008 06:00:22 GMT attachment set https://svn.boost.org/trac10/ticket/1700 https://svn.boost.org/trac10/ticket/1700 <ul> <li><strong>attachment</strong> → <span class="trac-field-new">floyd_warshall_shortest.hpp.patch</span> </li> </ul> Ticket Douglas Gregor Fri, 05 Sep 2008 13:59:13 GMT status changed; resolution set https://svn.boost.org/trac10/ticket/1700#comment:1 https://svn.boost.org/trac10/ticket/1700#comment:1 <ul> <li><strong>status</strong> <span class="trac-field-old">new</span> → <span class="trac-field-new">closed</span> </li> <li><strong>resolution</strong> → <span class="trac-field-new">fixed</span> </li> </ul> <p> (In <a class="changeset" href="https://svn.boost.org/trac10/changeset/48611" title="Fix handling of infinite weights in Floyd-Warshall algorithm. Fixes #1700">[48611]</a>) Fix handling of infinite weights in Floyd-Warshall algorithm. Fixes <a class="closed ticket" href="https://svn.boost.org/trac10/ticket/1700" title="#1700: Patches: graph/floyd_warshall_shortest.hpp.patch (closed: fixed)">#1700</a> </p> Ticket