graph
graph copied to clipboard
boostorg
Boost.org graph module
(Note: this PR builds in #375 and #374) Three commits in this PR: 1. ad11d2e8 Fix non-keyword subgraph parsing 1. 82f623f7 test_subgraphs verifies (keyword) subgraphs parse 1. 95b80a93 max_subgraph_nesting_level in...
https://bugs.chromium.org/p/oss-fuzz/issues/detail?id=66719 ``` +----------------------------------------Release Build Stacktrace----------------------------------------+ Command: /mnt/scratch0/clusterfuzz/resources/platform/linux/unshare -c -n /mnt/scratch0/clusterfuzz/bot/builds/clusterfuzz-builds_boost_fa513528a55ae19c064fe12b99e08e0dbc98b83f/revisions/boost_graph_graphviz_fuzzer -rss_limit_mb=2560 -timeout=60 -runs=100 /mnt/scratch0/clusterfuzz/bot/inputs/fuzzer-testcases/crash-ec3a74d351f80590a35c0c6bace0c3a2fd548235 Time ran: 0.5343647003173828 INFO: Running with entropic power schedule (0xFF, 100). INFO: Seed: 49547342 INFO: Loaded...
(note this PR builds on #374) The code was mostly fine (except for unhygienic `using namespace` in places), but it was hard to see what was covered. I've seperated fixtures...
Works around invalidation of bundle property maps (see #373). The `#if SEHE_UNSTABLE_PROPERTY_MAPS_FIXED` section is there to signal my intent to investigate a generalized fix under that issue. It doubles as...
The unit test `test_basic_csr_directed_graph` has been there, but disabled ever since it was added in 2012 because it didn't work. The corresponding version with external properties worked. I analyzed it...
Google Research blog post: https://research.google/blog/solving-the-minimum-cut-problem-for-undirected-graphs/ The actual paper: https://epubs.siam.org/doi/10.1137/1.9781611977912.111 This would presumably be a considerable improvement over our existing Stoer Wagner algorithm.
If any of y'all end up using boost::subgraph and try to add property map to it, then vertex_index_t does not work(looks like it is internally used by subgraph.
It includes `lexical_cast.h` which no longer supports C++03.
Here is a MWE of my code: ``` #include #include #include #include int main(int, char**){ std::ifstream graph_file; graph_file.open("more_exampleHoles_8.txt", std::ifstream::in); Graph g; boost::dynamic_properties dp; boost::read_graphml(graph_file, g, dp); } ``` The file...
Hello, ( X-Posted on https://stackoverflow.com/questions/78056215/what-does-negative-flow-on-a-reverse-arc-of-a-graph-in-boykov-kolmogorov-max-flo ) In trying to solve the example problem provided on Boost's website: https://www.boost.org/doc/libs/1_54_0/libs/graph/example/boykov_kolmogorov-eg.cpp (the code has to be run as ` < max_flow.dat` where `max_flow.dat`...
