Phil Ratzloff

I appreciate your looking at the details. There are some potential major changes to the whole API, so I don't want to put much time into this at the moment....

I chose to use a recent version of fmt to provide the latest capabilities in the library, as they continue to improve it, without requiring us to bump graph-v2 to...

CMake should be downloading the {fmt} library if you "Delete Cache and Reconfigure". There's now dijkstra_shortest_paths.hpp and bellman_ford_shortest_paths. This is similar to how Boost Graph does these algorithms. In the...

Thanks for your comment. I'll consider your recommendation. I'm not sure why you're running into a problem because I've been using the latest MSVC all along. I know it's been...

I'll work on getting a fix in, hopefully before I go on break next week. Sent from Outlook From: Andrzej Krzemieński ***@***.***> Sent: Friday, September 13, 2024 1:31 AM To:...

I'll create an independent set of definitions outside of MSVC & gcc, as you suggest. I'll try to get it in later this week.

I've pushed a fix. I'd appreciate it if you could let me know whether it works for you or not.

It's possible to load directed or undirected. If you want to load a directed graph with edges reversed you'll need to create the reversed edges outside the graph. Andrew has...

While I've added an implementation for dijkstra shortest paths and shortest distances, Andrew has expanded the shortest paths algorithms in P1709. This is continuing.

In theory, yes, though they may require refinement. It needs testing; I haven't had a chance to pursue that. One are in particular that needs some attention is whether vertex_id()...