Re: [graph] which algorithm/visitor to use?

From: Steven Watanabe (watanabesj_at_[hidden])
Date: 2025-05-10 22:41:25

AMDG

On 5/10/25 1:49 PM, Andrzej Krzemienski via Boost wrote:
> <snip>
> The task is to enumerate all paths between two given vertices U and V, in
> an efficient way naturally, given the following constraints:

That could be a lot of paths.

> 1. The path cannot be composed of more than N edges
> 2. The path cannot contain a vertex "too far away from U and V", that is,
> there would be a predicate P that tells for a given vertex W the value P(U,
> V, W) that tells if vertex W is acceptable.
> 
> So, I would need a tool that instructs the algorithm that when a certain
> vertex or an edge is encountered, an algorithm should be skipped on a given
> branch of the graph, but resume from the next branch. Is there a tool like
> that in Boost.Graph?
> 

filtered_graph?

In Christ,
Steven Watanabe