boost-graph

问题 I'm new to Boost graph library and I try to draw a graph using graphviz. #include <boost/graph/adjacency_list.hpp> #include <boost/graph/graphviz.hpp> #include <boost/utility.hpp> // for boost::tie #include <iostream> #include <utility> // for std::pair using namespace boost; using namespace std; class V {}; class C {}; void draw_test(){ typedef boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, V, C > MyGraph; typedef boost::graph_traits<MyGraph>::vertex_descriptor

问题 after implementing some algorithm using the BGL, im trying to provide io functions using GraphML. However, i dont manage to compile a suitable operator<< that takes a const Graph reference. Here is a boiled down example: // use bundled properties for vertices and edges struct VertexProperty { double error; }; typedef boost::adjacency_list< boost::setS, boost::setS, boost::undirectedS, VertexProperty> Graph; typedef typename boost::graph_traits<Graph>::edge_descriptor edge_descriptor; typedef

问题 I'm using bundled properties and adjacency_list and would like to use the subgraph class. struct Vertex { int index; int seed; }; struct Edge { bool visted; double weight; }; typedef adjacency_list<listS, listS, undirectedS, Vertex, property<edge_index_t,int,Edge> > Graph; typedef subgraph<Graph> testSubgraph; The property<edge_index_t,int,Edge> part is needed, as subgraph needs edge_index_t to compare two edges. Now my question is how do I add an Edge using bundled properties in a Subgraph?

问题 I want to create a minimum spanning tree from vertices with edge weights and traverse the graph in depth-first order. I can build the graph and the minimum spanning tree but I am failing at writing the custom visitor. #include <iostream> #include <boost/graph/adjacency_list.hpp> #include <boost/graph/kruskal_min_spanning_tree.hpp> #include <boost/graph/depth_first_search.hpp> #include <boost/graph/graph_traits.hpp> #include <vector> #include <string> typedef boost::property<boost::edge_weight

问题 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

问题 I've just begun learning bgl and have hit on a problem while using a std::set with a custom ordering as the container for edge lists in an adjacency_list. I define the operator< to order the edges based on their properties, much like in the ordered_out_edges.cpp example. Here boost::edge_unique_ordering is a custom property tag. template < typename Edge > struct order_by_unique_order: public std::binary_function< Edge, Edge, bool > { inline bool operator() (const Edge& e1, const Edge& e2)

问题 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. 回答1: It seems that boost::depth

问题 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

问题 I'm writing a library for manipulating bond graphs, and I'm using the Boost Graph Library to store the data for me. Unfortunately, I can't seem to figure out how to implement a proper visitor pattern using it, as you can't subclass out vertices - you must rely on 'properties' instead. The visitor framework provided in the library seems heavily geared towards working with certain algorithms where vertices are all of the same type, but store different information. In my problem, the vertices

问题 How should I modify the bundled properties of a vertex from inside a visitor? I would like to use the simple method of sub-scripting the graph, but the graph parameter passed into the visitor is const, so compiler disallows changes. I can store a reference to the graph in the visitor, but this seems weird. /** A visitor which identifies vertices as leafs or trees */ class bfs_vis_leaf_finder:public default_bfs_visitor { public: /** Constructor @param[in] total reference to int variable to