Comments (2)
Ok, this is trivial to fix, just change the member add_edge
to the global add_edge
. Unfortunately, that leaves us with a particularly useless fragment of code that compiles.
Right now the interface to labeled_graph is undocumented. If we make a sane example, we should document the class we are demonstrating. Do we want to document it?
from graph.
Right now the interface to labeled_graph is undocumented. If we make a sane example, we should document the class we are demonstrating. Do we want to document it?
Oh :(
Down and down the rabbit hole we go!
Looks like this was something that was never finished, a quick google suggests that folks have found it and are actually using it though, also that it has some serious issues: https://stackoverflow.com/questions/46012477/boost-labeled-graph-doesnt-delete-vertices
(Aside: someone should probably triage the issues languishing on the old Trac for this library)...
So.... I guess if you think you have the time to polish this header off and document it, then more power to you for sure, whether it's the most important thing to fix I'm not sure, looks like something that should be fixed at some point though I guess.
from graph.
Related Issues (20)
- A mistake in r_c_shortest_paths_example.cpp HOT 1
- `depth_first_visit_impl`: `finish_edge` not invoked when it should on MSVC HOT 2
- Algorithm for generating a random Flow Network/Graph HOT 1
- [Feature request] Implementation of Held-Karp lower bound for the TSP HOT 1
- Improve docs for ResourceExtensionFunction in r_c_shortest_paths
- Boost.Graph no longer builds with C++03 HOT 6
- astar_search does unnecessary initialization of vertices
- broken link to example for reverse graph adaptor HOT 6
- adjacency_matrix::add_vertex always aborts in Debug mode ? HOT 2
- Single-path RCSP does not return always the shortest path HOT 7
- Stack-overflow in boost::read_graphviz_detail::parser::parse_subgraph HOT 23
- Option to allow `breadth_first_search` to use `in_edges`
- Question on negative flow on arcs in Boykin-Kolmogorov algorithm -- meaning and interpretation
- Modular Boost C++ Libraries Request HOT 1
- read_graphml function rejecting well formed Graphml files HOT 1
- If using Boost::subgraph. Don't use Vertex_index_t.
- New near-linear time algorithm to solve the minimum cut problem for undirected graphs HOT 8
- CSR: Indexed properties maps are unstable
- creation of nested subgraphs by vertex descriptors is broken/unintuitive HOT 5
- kruskal_minimum_spanning_tree not working on filtered graph with weight map as named property
Recommend Projects
-
React
A declarative, efficient, and flexible JavaScript library for building user interfaces.
-
Vue.js
🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.
-
Typescript
TypeScript is a superset of JavaScript that compiles to clean JavaScript output.
-
TensorFlow
An Open Source Machine Learning Framework for Everyone
-
Django
The Web framework for perfectionists with deadlines.
-
Laravel
A PHP framework for web artisans
-
D3
Bring data to life with SVG, Canvas and HTML. 📊📈🎉
-
Recommend Topics
-
javascript
JavaScript (JS) is a lightweight interpreted programming language with first-class functions.
-
web
Some thing interesting about web. New door for the world.
-
server
A server is a program made to process requests and deliver data to clients.
-
Machine learning
Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.
-
Visualization
Some thing interesting about visualization, use data art
-
Game
Some thing interesting about game, make everyone happy.
Recommend Org
-
Facebook
We are working to build community through open source technology. NB: members must have two-factor auth.
-
Microsoft
Open source projects and samples from Microsoft.
-
Google
Google ❤️ Open Source for everyone.
-
Alibaba
Alibaba Open Source for everyone
-
D3
Data-Driven Documents codes.
-
Tencent
China tencent open source team.
from graph.