graph

graph copied to clipboard

As in the title. Consider the following code ```cpp #include #include #include #include typedef int v_index; typedef long e_index; typedef boost::adjacency_list< boost::vecS, // OutEdgeList boost::vecS, // VertexList boost::undirectedS, // DirectedS...

user202729

Split CMake identities: superproject and 'developer'

11

I prefer to use CMake as a build system, but the existing CMake files in Boost don't really help. 1. I don't want to treat every library as an active...

jeremy-murphy

`is_connected()` is too slow

1

is_connected function is documented as ``` // Is the undirected graph connected? // Is the directed graph strongly connected? ``` and achieves this goal by checking if each vertex is...

Wavetrace

new planar_vertex_six_coloring() algorithm with examples, tests and doc

19

Why planar_vertex_six_coloring() is useful can be seen in the first of three tests for that algorithm. The existing sequential_vertex_coloring() can be forced to use $k$ colors for any $k$ (k=15...

Hermann-SW

Apply std::remove_const before passing Graph to graph_traits in filtered_graph

4

For instance `detail::residual_graph` explicitly applies const to the graph. Consequently graph_traits would have to be defined also for the const graph type, but [the LEDA graph example](https://www.boost.org/doc/libs/1_86_0/libs/graph/doc/leda_conversion.html) does not seem...

tsnorri