https://svn.boost.org/trac10/ticket/9368 <p> The current implementation of prim_minimum_spanning_tree makes the following assumptions about edge weight types: </p> <p> + weights have the less-than (&lt;) operator defined </p> <p> + weight identity value is 0 </p> <p> + the maximum weight value is accessible by std::numeric_limits&lt;W&gt;::max() </p> <p> I've attached a patch that removes these requirements of edge weights by allowing users to use the distance_compare, distance_zero, and distance_inf named parameters. These parameters are passed to the dijsktra_shortest_paths() call that underlies the prim_minimum_spanning_tree function. </p> en-us /htdocs/site/boost.png https://svn.boost.org/trac10/ticket/9368 Trac 1.4.3 lgtorres42@… Tue, 12 Nov 2013 04:34:13 GMT https://svn.boost.org/trac10/ticket/9368 https://svn.boost.org/trac10/ticket/9368 <ul> <li><strong>attachment</strong> → <span class="trac-field-new">prim-patch.patch</span> </li> </ul> <p> general edge weight patch to BGL prim's minimum spanning tree </p> Ticket lgtorres42@… Tue, 12 Nov 2013 04:42:54 GMT