graph
graph copied to clipboard
boostorg
Boost.org graph module
https://github.com/GrammaTech/gtirb/blob/2bc074282ef1e33d1988ce8f069252810d1307a3/include/gtirb/CFG.hpp#L81 using type = boost::adjacency_list< OutEdgeListS, VertexListS, DirectedS, // Vertices are CfgNodes. CfgNode*, // Edges have labels. EdgeLabel, // The graph keeps track of vertex descriptors for // each node....
Is there some source that explains why GraphvizDigraph is not used anymore? I see that many examples in books/web still refer to it.
**Environment:** VS 2019 + Windows Server 2016 **Issue description:** One test fails to compile after boostorg/msm submodule graph updated from 65a65c7 to 3cabf1a boost/graph @ 554da29. Could you please take...
In our project at work we use custom boost archive for serialization and deserialization, and unsigned integers are serialized in a non-trivial way, which does not match with serialization of...
removing an element from a stack does not always work, since the predecessor of a stack element is not (always) stored. this patch merges the array head into next, so...
The Boyer-Myrvold planarity test for [prism graphs](https://en.wikipedia.org/wiki/Prism_graph) appears to run in quadratic time complexity: ``` c++ #include #include #include #include using namespace std; using namespace boost; // Follows libs/graph/example/simple_planarity_test.cpp. using...
If the project has a function with the same name, a name conflict occurs error C2668: add_edge
Dear all, Are there plans to implement [Karp's minimum mean cycle ](https://www.sciencedirect.com/science/article/pii/0012365X78900110) algorithm in Boost? If not, I would be willing to contribute (although my C++ is quite rusty). An...
Given two graphs that are the same and only contain a single vertex, boost isomorphism returns the wrong property map. ``` #include #include #include #include using namespace boost; int main()...
