graph

graph copied to clipboard

connected_components called on empty filtered graph

1

The connected_components function returns `(std::numeric_limits::max)() + 1` when called on a filtered graph with all vertices filtered out. An example of this problem can be found here: https://godbolt.org/z/vWsG8j If the...

pgerell

Error C2672: 'equal_range_dispatch': no matching overloaded function found

5

Hello, I am currently in the process of getting an existing code base which builds fine on linux to build windows and I have ran into an issues with a...

Levi-Armstrong

revising BGL code (isomorphism.hpp) that uses abort()

4

https://github.com/boostorg/graph/blob/887e63d34e977ae439e392282422d2b82791a730/include/boost/graph/isomorphism.hpp#L321 is an abort() call. This is a problem for interoperation with R as the static checker warns about such calls, and warnings preclude inclusion of packages in certain ecosystems....

vjcitn

[Q] `finish_edge` in non-recursive DFS

4

Could you please clarify implementation of directed and undirected DFS, non-recursive ones? Take a look at these lines: [depth_first_search.hpp#L173..L178](https://github.com/boostorg/graph/blob/ca17604dca362e0378ca14c7e8cf9a57a0c887ad/include/boost/graph/depth_first_search.hpp#L173..L178) Here is comment: > `finish_edge` has to be called here, not...

qbit86

The sloan ordering algorithm before this patch could not handle disconnected graphs. We ran into this problem with the development of LTSmin and made this patch. This was already two...

bergfi

[Question/Issue] Add named vertex does not work proper

3

Hi guys! I'm studying BGL now and I found a [tutorial](https://github.com/richelbilderbeek/BoostGraphTutorial/blob/master/boost_graph_tutorial.pdf) for it. Everything worked fine from it until I reached function to add_named_vertex. Here is a piece of code...

DwarKapex

Using [`bron_kerbosch_all_cliques`](https://www.boost.org/doc/libs/1_72_0/boost/graph/bron_kerbosch_all_cliques.hpp) results in an unused variable warning ``` /usr/local/include/boost/graph/bron_kerbosch_all_cliques.hpp:227:41: error: unused variable 'j' [-Werror,-Wunused-variable] typename Container::iterator i, j; ^ /usr/local/include/boost/graph/bron_kerbosch_all_cliques.hpp:289:13: note: in instantiation of function template specialization 'boost::detail::extend_clique' requested...

dancooke

tiernan_all_cycles doesn't work out of the box with adjacency_list

3

there might be a bug in `boost/graph/tiernan_all_cycles.hpp` which comes from tiernan_all_cycles.hpp, line 161: `BOOST_CONCEPT_ASSERT(( VertexIndexGraphConcept ));` and then in graph_concepts.hpp on line 469/70 ``` // This is relaxed renumber_vertex_indices(g); ```...

wonkoRT

My code using `boost::graph::isomorphism(g1, g2)` works with boost 1.70.0 but fails to compile with boost 1.71.0. I'm using clang 9. For a reproducer, see https://godbolt.org/z/bysaYi

mgehre

std::max_element requires forward iterator

4

std::max_element contract required forward iterator. Graph library's uses this interface in betweenness_centrality_clustering on edge iterators, which according to boost iterator library are deduced as input iterators. This fails to build...

rogeeff