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