Bugs item #1284336, was opened at 2005-09-07 22:24 Message generated for change (Tracker Item Submitted) made by Item Submitter You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=107586&aid=1284336&group_id=7586 Please note that this message will contain a full copy of the comment thread, including the initial issue submission, for this request, not just the latest update. Category: graph Group: None Status: Open Resolution: None Priority: 5 Submitted By: Grégoire Dooms (dooms) Assigned to: Jeremy Siek (jsiek) Summary: dijkstra_shortest_path doesn't scan the whole component Initial Comment: Disjkstra Shortest path stops in the middle of the graph. I think this is because of a bug in relaxed_heap. This bug is present in boost 1.33 and boost cvs HEAD. It is however not present in debian boost-graph-dev version 1.32.0-6. I attach a source code which demonstrates the bug. It produces a dot file with the nodes labeled with distances from the source and the arcs labeled with their weight. The bug is present if some nodes have a 2147483647 label. ---------------------------------------------------------------------- You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=107586&aid=1284336&group_id=7586 ------------------------------------------------------- SF.Net email is Sponsored by the Better Software Conference & EXPO September 19-22, 2005 * San Francisco, CA * Development Lifecycle Practices Agile & Plan-Driven Development * Managing Projects & Teams * Testing & QA Security * Process Improvement & Measurement * http://www.sqe.com/bsce5sf _______________________________________________ Boost-bugs mailing list Boost-bugs@lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/boost-bugs