Phil Ratzloff

That's true, until you accept a string as an ID. In the last product I worked on, which is a distributed graph for entity resolution, the Id is roughly a...

The general design is intended to work, but I'm almost certain there are details that aren't correct. That's an area that needs to be flushed out and refined. Sent from...

I think there are a couple of issues. The implementation in dijkstra_shortest_paths should be more explicit: if constexpr (has_on_discover_vertex) { visitor.on_discover_vertex( vertex_info{source, *find_vertex(g, source)}); } Your example for MyVisitor::on_discover_vertex(auto const&...

I agree that the library should be as flexible as is reasonably possible. In your last example, I'm trying to understand what the type passed in the second example is....

That's an area I was staying away from initially. It's an area that needs attention eventually. Sent from Outlook ________________________________ From: Andrzej Krzemieński ***@***.***> Sent: Tuesday, June 24, 2025 3:26...

The current design reflects the existing containers and algorithms in the STL. Algorithms will do something, typically given a range, and return a result without modifying the underlying container. General...

The message referring to g.target_id(g,uv) should be target_id(g,uv), without the "g." prefix. target_id(g,uv) is used with find_vertex(g,uid) to get a vertex reference as default behavior. It makes sense to update...

I think your referring to the graph::views::vertices_breadth_first_search . That's a good question. FWIW P3129 Graph Views doesn't specify that the views are customization points. I believe the views in ranges...

It's not on our targeted algorithms list. Andrew is the algorithm expert, so I'll have him answer your question. Sent from Outlook ________________________________ From: Andrzej Krzemieński ***@***.***> Sent: Wednesday, May...

Hi — We are planning to have filtering, but Yen’s algorithm seems very specialized. We are unlikely to have it in the first set of proposed algorithms. Best, Andrew Lumsdaine...