graph
graph copied to clipboard
boostorg
Boost.org graph module
When trying to build parallel graph examples using boost 1.76 I get errors like this: ``` In file included from /usr/local/include/boost/graph/breadth_first_search.hpp:26, from src.cpp:19: /usr/local/include/boost/graph/two_bit_color_map.hpp:106:34: fatal error: boost / graph /...
The Boost small-world generator as defined in [small_world_generator.hpp](https://github.com/boostorg/graph/blob/develop/include/boost/graph/small_world_generator.hpp) can produce parallel edges. The problem lies in lines 74–76: ```cpp if (x < prob) { vertices_size_type lower = (source + n...
breath_first_search appears to not be robust against degenerate graphs, such as a single vertex with no edges. Adding an edge connecting this single vertex to itself seems to be a...
Reported as ldionne/hawick_circuits#1.
Hi, thanks for the great work! It seems that the disjoint_sets can not be serialized using Boost:Serialization, is it correct? If so, do you have any plan to add this...
See #238 Closes #238 If formatting or anything is to be changed let me know.
I don't think it's currently possible to get each "level" from`topological_sort` (where a level contains the set of vertices with no unfinished dependencies e.g. if a depends on b, b...
Hello everyone bare with me if this has no place here but I have a requirement for a professional project to find every best feasible path to every vertex in...