graph
graph copied to clipboard
boostorg
Boost.org graph module
This is a long way from finished but it might be useful to start a discussion about it early. First thing: this is not a true pull request. This is...
Why does API [takes](https://github.com/boostorg/graph/blob/d865589d62afba7ca590bfcaf76f0723f8494dd4/include/boost/graph/astar_search.hpp#L357) predecessor map as an argument? Anyway, it can be restored using the `edge_relaxed` visitor callback, right?
`astar_bfs_visitor` calls `m_vis.edge_relaxed` _before_ setting the new cost map value in `tree_edge` and `black_target` (and in `astar_search_no_init_tree`'s main loop from the looks of it), but _afterwards_ in `gray_target`. This is...
When @daankolthof added more tests to MAS, it occurred to me that different but equally correct implementations of the algorithm might return different orderings when tie-breaking edges with equal weights....
There are several things wrong with `maximum_adjacency_search`: - The pseudo code on https://www.boost.org/doc/libs/1_79_0/libs/graph/doc/maximum_adjacency_search.html does not mention any weights. Yet, `weights` is a required parameter. It's unclear what it is doing....
Hi! ## Questions - Is there a non-official project that documents the BGL in a more user-friendly way than the official documentation? - Is there a will to update/complement/modernize the...
In the doc page for adjacency matrices there is an error for undirected graphs. It says: > In the case of an undirected graph, the adjacency_matrix. class does not use...
I have been trying to preload adjacency matrices with bundled properties to a std::vector of adjacency matrices in order to benchmark some uni project algorithm and not by chance measure...
in stl, there are both checked and unchecked method to access the value from container ```cpp vector[0]; // unchecked, may UB vector.at(1); // checked, may throw map["key1"]; // auto add...
