boost-graph

I am struggling to get a custom property writer to work with BGL. struct IkGraph_VertexProperty { int id_ ; int type_ ; std::pair<int,int> gaussians_ ; // Type of Joint, Ids of Gaussians }; struct IkGraph_VertexPropertyTag { typedef edge_property_tag kind; static std::size_t const num; }; std::size_t const IkGraph_VertexPropertyTag::num = (std::size_t)&IkGraph_VertexPropertyTag::num; typedef property<IkGraph_VertexPropertyTag, IkGraph_VertexProperty> vertex_info_type; ...custom graph defined in method typedef adjacency_list<setS, vecS, bidirectionalS, vertex_info_type, IkGraph_EdgeProperty>

I am working on a directed graph (actually a bidirectional one) with Boost.Graph. I'd like to use the layout algorithms that exist (either Kamada-Kawai or Fruchterman-Reingold) but they only accept undirected graphs as parameters. What is the simplest way to use these layout algorithms ? More generally, what's the right way to lure an algorithm into thinking that a directed graph is actually undirected ? Thanks, Benoît Are you sure that Fruchterman-Reingold algorithm only accepts undirected graphs? I tried to run the little example from the Boost documentation using a bidirectional graph

I have a problem with using the adjacency-list of the Boost Graphics Library. It seems to be a circular dependency problem: I have a typedef T of a template which uses some class A. Additionally A stores a pointer to an object of type T. Now the compiler tells me, that T does not name a type. Here are excerptions of my more concrete files: //graphdefinitions.hpp #include "lane.hpp" #include "tie.hpp" typedef boost::adjacency_list<boost::listS, boost::listS, boost::directedS, Tie, Lane> Map; typedef boost::graph_traits<Map>::edge_descriptor edge_descriptor; //lane.hpp #include "graphdefinitions

I want to have all edges have to properties, weight and capacity. I found that BGL has these both already defined. So I define Edge and Vertex properties for the Graph typedef property<vertex_name_t, string> VertexProperty; typedef property<edge_weight_t, int, property<edge_capacity_t, int> > EdgeProperty; typedef adjacency_list<listS,vecS, undirectedS, VertexProperty, EdgeProperty > Graph; Here is where I am trying to add the edges to the graph: 172: EdgeProperty prop = (weight, capacity); 173: add_edge(vertex1,vertex2, prop, g); If I had just 1 property I know it would be prop = 5; However,

Is there a popular algorithm for the planarization of a non-planar graph. I'm currently planning to implement a Orthogonal Planar Layout algorithm for undirected graphs in Boost ( Boost Graph Library ). BGL has an implementation to check the planarity of an undirected graph ( Boyer-Myrvold Planarity Testing ) and I plan to use the planar embedding returned by this method to do an orthogonal layout. But I'm not sure what should be done if the input graph is non-planar. Should I do something with the Kuratowski sub-graph returned in such a scenario to make the graph planar. A Google Search on

How can I copy a graph of type adjacency_list to another one graph of type adjacency_list ? typedef adjacency_list<setS, setS, undirectedS, NodeDataStruct, EdgeDataStruct> MyGraph; MyGraph g1, g2; // processing g1: adding vertices and edges ... // processing g2: adding some vertices and edges ... g1.clear(); g1 = g2 // this gives an execution error (exception) g1 = MyGraph(g2); // this also gives an execution error g2.clear(); Andrew Durward Have you tried copy_graph ? Hard to know what the problem is without seeing the errors but if I had to guess, I'd first make sure you're providing a

I'm currently looking at the documentation of Boost Dijkstra - http://www.boost.org/doc/libs/1_52_0/libs/graph/doc/dijkstra_shortest_paths.html ; my objective is to modify the distance combining to get a "max" instead of a "plus" when computing my distances. The doc says this: IN: distance_combine(CombineFunction cmb) This function is used to combine distances to compute the distance of a path. The CombineFunction type must be a model of Binary Function. The first argument typ of the binary function must match the value type of the DistanceMap property map and the second argument type must