27 Sep
2012
27 Sep
'12
5:27 a.m.
Thanks Jeremiah. I will look into the filtered graph. I didn't know that it would work with shortest path algorithms in such a way that if you masked a vertex, it would not be considered in the SP calculations anymore. Another thing I just realised was that I might have to loop through these vertex IDs in decreasing order of a scoring function, rather than just in decreasing order of vertex IDs. So in that case a filtered graph is my only option yeah? Thanks, Ed -- View this message in context: http://boost.2283326.n4.nabble.com/BGL-vecS-for-vertex-container-and-vertex-... Sent from the Boost - Users mailing list archive at Nabble.com.