graph-v2
graph-v2 copied to clipboard
stdgraph
General-purpose C++ graph library
A graph library is useful for build systems. In this case, you would most likely want toposort to fail if it sees a cyclic dependency. Would this be an option...
Implementation added, added to P1709, & reviewed in SG19. Open questions/issues 1. pass BFS in instead of Queue? (Andrew); Kevin is thinking about it 2. add example to P1709
Hi, After latest pull when including ``` #include "graph/views/vertexlist.hpp" ``` a compile yields: ``` In file included from src/bipartite_test.cpp:26: ../cpp_modules/graph-v2/include/graph/views/vertexlist.hpp: In member function ‘constexpr graph::vertexlist_iterator::value_type& graph::vertexlist_iterator::operator*() const’: ../cpp_modules/graph-v2/include/graph/views/vertexlist.hpp:167:36: error: ‘const...
There is a 14-line little class in both "graph/algorithm/breadth_first_search.hpp" and "graph/algorithm/depth_first_search.hpp" that is `dfs_visitor_base`. When you try to `#include` both headerfiles, the exact same definition appears in one translation unit...
Hi, at https://github.com/stdgraph/graph-v2/blob/master/include/graph/views/depth_first_search.hpp#L340 there is an inner struct ```end_sentinel``` with an == overload looking unsuccessfully for ```the_range_``` on itself as rhs is```end_sentinel``` type. There is a ```the_range_``` on the inner...
The implementation of the algorithms, use type deduction when invoking member functions of the visitors, as in: ```c++ if constexpr (has_on_discover_vertex) { visitor.on_discover_vertex({source, *find_vertex(g, source)}); //
The current Graph Container Interface requires the IDs to be _copy_constructible_. Suppose that I have my own graph representation that needs to use non-copyable IDs. How am I supposed to...