boost-graph

I'm writing an application that's parsing a data structure with something like struct Block { std::string foo; /* ... even more local data ... */ }; std::map<std::string, Block> blockContainer; // Each Block will have a name here struct Signal { // the direct links to the Blocks, no redundant storage of the name so that an // simple renaming of a Block would be possible std::map<std::string, Block>::iterator from; std::map<std::string, Block>::iterator to; std::string bar; /* ... even more local data ... */ }; std::vector<Signal> signalContainer; parsing and filling this list was quite easy.

So I'm using a boost graph of the following type: typedef boost::adjacency_list<boost::listS, boost::vecS, boost:directedS, VertexT, EdgeT> GraphT VertexT and EdgeT are both classes to keep many of the properties I need. These are bundled properties. I'm not sure if some of the ways I want to use bgl are possible so if you are familiar with them help would be much appreciated. VertexT and EdgeT are suppose to be polymorphic base classes. My understanding is bgl is not meant to use for pointers to these properties. How does one work with polymorphic vertex and edge properties with BGL? I

Currently I have the following code for a project that represents some probability trees and uses custom structs for the vertex and edge types: #include <boost/graph/adjacency_list.hpp> #include <boost/graph/graphviz.hpp> struct Vertex{ std::string name; size_t times_visited; float value; bool terminal_node; bool root_node; }; struct Edge{ float probability; }; //Some typedefs for simplicity typedef boost::adjacency_list<boost::listS, boost::vecS, boost::directedS, Vertex, Edge> directed_graph_t; typedef boost::graph_traits<directed_graph_t>::vertex_descriptor vertex_t; typedef boost::graph

I am trying to use the Boost Ggraph Library. On each iteration of my program, I have a set of points, e.g. {1,2,3,4,5,6,7,8,9,10} on iteration one and {1,2,3,...,1000} on iteration two, ... For each point I know which other points it is connected to, e.g. at iteration one every point is connected as below: c(1)={3,5,7,8} c(2)={} c(3)={1,4,10} c(4)={3} c(5)={1,9} c(6)={} c(7)={1,8} c(8)={1,7} c(9)={5} c(10)={3} Each point has a property, e.g. p(1)=10, p(2)=100, p(3)=20, ... How can I create an undirected graph in Boost and iterate over the connected component(s)? You will need to include the

I'm using boost::graph and its Dijkstra implementation. When someone is using the Dijkstra algorithm, it may be to know the shortest path between 2 nodes in a graph. But as you need to check all nodes in the graph to find the shortest path, usually (like the boost algorithm) Dijkstra gives you back all the distances between one origin point, and all the other nodes of the graph. One easy improvement of this algorithm when you only want the path between 2 nodes is to stop it when the algorithm reach the destination node. Then, you are sure that the distance that you have for this final

Minimal example: #include <boost/graph/graph_traits.hpp> #include <boost/graph/adjacency_list.hpp> #include <boost/graph/depth_first_search.hpp> struct vertex { int number; }; struct edge {}; typedef boost::adjacency_list<boost::listS, boost::vecS, boost::directedS, vertex, edge> graph_t; typedef boost::graph_traits<graph_t>::vertex_descriptor vertex_t; typedef boost::graph_traits<graph_t>::edge_descriptor edge_t; struct vertex_visitor : public boost::default_dfs_visitor { void discover_vertex(vertex_t v, graph_t& g) { g[v].number = 42; } }; int main() { graph_t g; vertex_t v1 = boost::add

I'm using BGL to store my DAG. Vertices have states. Given a change in state in one of the vertices i want to update dependent vertices. This i'm able to do using boost::depth_first_search and a custom visitor. Now the logic is that i dont want to update a searched vertex and its dependent if the vertex is in a particular state. Basically i want to control over en-queuing of vertices in either dfs or bfs. What is the best way to achieve this in BGL. Thanks. It seems that boost::depth_first_search does not support this, but the underlying boost::depth_first_visit does, through its 2nd overload

Using the Boost Graph Library I am looking for a way to extract the adjacency matrix from an underlying graph represented by either boost::adjacency_list or boost::adjacency_matrix . I'd like to use this matrix in conjunction with boost::numeric::ublas to solve a system of simultaneous linear equations. Here is a minimal example to get you going: #include <boost/graph/adjacency_list.hpp> #include <boost/graph/adjacency_matrix.hpp> using namespace boost; typedef boost::adjacency_list< listS, vecS, directedS > ListGraph; typedef boost::adjacency_matrix< directedS > MatrixGraph; int main(){

Say I found the node that meets my criteria and I need to stop the search. The solution is to throw an exception of your known type - then catch it on the calling side. From the FAQ : How do I perform an early exit from an algorithm such as BFS? Create a visitor that throws an exception when you want to cut off the search, then put your call to breadth_first_search inside of an appropriate try/catch block. This strikes many programmers as a misuse of exceptions, however, much thought was put into the decision to have exceptions has the preferred way to exit early. See boost email discussions