graph
graph copied to clipboard
boostorg
Boost.org graph module
**Context:** You want to create a `predecessors(source_node)` function gathering the vertices that point to a given `source_vertex`, you'd want to use a BFS visitor, which is currently impossible since the...
simple copy and paste error - I hope the HTML is the right place to fix
I found this in `graph/adjacency_matrix` ligne 966 : ```cpp template < typename D, typename VP, typename EP, typename GP, typename A > inline typename adjacency_matrix< D, VP, EP, GP, A...
These commits change the code in examples/ to use modern C++, specifically C++11. For instance, to use auto to avoid the verbosity of the traits and typedefs. Even if we...
Some graphs cause maximum_weighted_matching() to segfault due to a stack overflow when unit weights are used. Please see minimal example linked below which is a simple modification of the standard...
For maximum_weighted_matching the order in which edges are added to the graph makes a difference. For one order it works perfectly, but for the other the algorithm never terminates. Here...
From [Keith Bennet](https://github.com/boostorg/graph/wiki/Feedback-submissions-from-the-Boost-User-mailing-list#keith-bennett): > astar_search() takes too much time to initialize all vertices (in a 2048x2048x40 matrix) even though we only need to initialize vertices when they are added to...
When calling `remove_vertex` on a `labeled_graph` the vertex is removed but the label is not. A dangling reference to the vertex is left behind. Accessing it causes segfaults. Minimal example:...
Lines 94-104 in depth_first_search.hpp: ```c++ template < typename E, typename G, typename Vis > void call_finish_edge(Vis& vis, E e, const G& g) { // Only call if method exists #if...
This PR implements Link/Cut-Trees data structure for Boost Graph Library. Since disjoint_sets algorithms has been moved into boost/graph (#169), this should also be the right place to put link_cut_trees algorithm....
