boost-graph

问题 I'm trying to generate Erdos-Renyi graphs using boost graph library. In the code below, which is taken from The Boost 1.72 documentation the networks always have the same number of edges (they should not, for particular p values). I have tried using different random seeds to no avail. Thanks for any help. #include <boost/graph/adjacency_list.hpp> #include <boost/graph/erdos_renyi_generator.hpp> #include <boost/random/linear_congruential.hpp> #include <iostream> using namespace std; typedef

问题 I'm trying to generate Erdos-Renyi graphs using boost graph library. In the code below, which is taken from The Boost 1.72 documentation the networks always have the same number of edges (they should not, for particular p values). I have tried using different random seeds to no avail. Thanks for any help. #include <boost/graph/adjacency_list.hpp> #include <boost/graph/erdos_renyi_generator.hpp> #include <boost/random/linear_congruential.hpp> #include <iostream> using namespace std; typedef

问题 I have written this Class as a start to build My Algorithm, but I can see Before word on console, but not After ! what is my mistake in using Dijkstra Algorithm of Boost ?? #include <myalgorithm.h> #include<mygraphbuilder.h> //=============================================== using namespace std; using namespace boost; //=============================================== MyAlgorithm::MyAlgorithm()// Default constructor { } //=========================================================================

问题 I have written the following function to print out just the size of My Graph Nodes and Edges, but this function didn't work, the Error was : error: invalid use of non-static data member 'MyGraph' typedef adjacency_list < vecS, vecS, directedS, property < vertex_name_t, idType >, property < edge_weight_t, double > > graph_t; class MyGraphBuilder{ private: graph_t MyGraph; } void MyGraphBuilder::printGraph(MyGraphBuilder::MyGraph){ unsigned long long NodesCount = num_vertices(MyGraphBuilder:

问题 Being new to the boost graph library, I find it's often difficult to tease out what pieces of the examples are tied to the particular example and which parts are universal to usage. As an exercise, I'm trying to make a simple graph, assign a color property to the vertices, and output the result to graphviz so colors appear as color attributes that get rendered. Any help would be appreciated! Here's what I have so far (more specific usage questions are in the comments here): #include "fstream"

问题 Being new to the boost graph library, I find it's often difficult to tease out what pieces of the examples are tied to the particular example and which parts are universal to usage. As an exercise, I'm trying to make a simple graph, assign a color property to the vertices, and output the result to graphviz so colors appear as color attributes that get rendered. Any help would be appreciated! Here's what I have so far (more specific usage questions are in the comments here): #include "fstream"

问题 I have a boost graph with multiples weights for each edges (imagine one set of weights per hour of the day). Every one of those weights values is stored in a propretyEdge class : class propretyEdge { std::map<std::string,double> weights; // Date indexed } I created a graph with those properties, and then filled it with the right values. The problem is now that I want to launch the Dijkstra algorithm over a particular set of weight on the graph : for example a function that could be : void

问题 I am trying to do an example with read_graphviz but I can not help the linker to link the read_graphviz function call to the correct version read_graphviz. At http://www.boost.org/doc/libs/1_61_0/libs/graph/doc/read_graphviz.html there are three template versions of read_graphviz: namespace boost { template <typename MutableGraph> bool read_graphviz(std::istream& in, MutableGraph& graph, dynamic_properties& dp, const std::string& node_id = "node_id"); template <typename MutableGraph> bool

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

问题 I have a need to use the Boost library to get the shortest path from one point to another. I've looked over the example code and it is decently easy to follow. However, the example only shows how to get the overall distances. I'm trying to figure out how to iterate over the predecessor map to actually get the shortest path and I can't seem to figure it out. I've read these two questions on the subject: Dijkstra Shortest Path with VertexList = ListS in boost graph Boost:: Dijkstra Shortest