Boost logo

Boost Users :

Subject: Re: [Boost-users] [BGL] vecS for vertex container and vertex index adjustments
From: Jeremiah Willcock (jewillco_at_[hidden])
Date: 2012-09-27 12:56:24


On Wed, 26 Sep 2012, Ed Linde wrote:

> 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.

That is how it is supposed to work for all algorithms, not just shortest
path ones.

> 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?

I think it would be the easiest option.

-- Jeremiah Willcock


Boost-users list run by williamkempf at hotmail.com, kalb at libertysoft.com, bjorn.karlsson at readsoft.com, gregod at cs.rpi.edu, wekempf at cox.net