Hi, <br><br>i&#39;m trying to write a demo of prim/dijkstra algorithm (without using the stock code in BGL). <br>but i&#39;m lost at how to set up the priority queue with key updates (mutable queue, that is).<br><br>how do i set up the distance map? or should the distance be the property of each vertex?<br>
and internally, how is distances of vertices maintained?<br><br>thanks<br><br><br>