graph
graph copied to clipboard
boostorg
Boost.org graph module
This is part of the effort to make the Boost libraries "modular" for build and consumption. See https://lists.boost.org/Archives/boost/2024/01/255704.php and https://github.com/grafikrobot/boost-b2-modular/blob/b2-modular/README.adoc for more information. This PR depends on the following other...
When using `subgraph::create_subgraph(VertexIterator first, VertexIterator last)`, the vertex descriptors are interpreted as vertex descriptors into the root graph. (`add_vertex` expects the given descriptor to be a root graph descriptor). My...
When creating subgraphs on deeper levels of the subgraph tree, do not nterpret the vertex descriptors as global, but instead as vertex descriptors to the current graph. Fix to https://github.com/boostorg/graph/issues/378
Hi everyone, i cant use kruskal's alg on a filtered graph with a weight_map as named property. ``` #include #include "boost/graph/graph_utility.hpp" #include #include #include using Graph = boost::adjacency_list; using Vertex...
I was going through the implementation of the Lengauer-Tarjan algorithm in BGL's domibator_tree.hpp and have found that there is a vector of std::deque to store buckets: vertices with the given...
According to `filtered_graph`'s documentation, the refinements of the model of the underlying graph are optional.
The `is_connected()` function is implemented in terms of `is_rechable()`, effectively checking if each vertex is reachable from each other vertex in a nested loop. This quickly becomes terribly slow as...
I read in section "Future Work" of [`boost::read_graphviz()`](https://www.boost.org/doc/libs/1_87_0/libs/graph/doc/read_graphviz.html): > - Passing port information to BGL. > [...] I couldn't find any related ongoing work on Github: - Is someone working...
