Tagged Questions
0
votes
0answers
9 views
Boost Graph identifying vertices
I need to map vertices in a Boost Graph to an unsigned integer. I learned from related posts on this site (1, 2) that the proper way to do this is to create a custom vertex class.
struct Vertex { ...
1
vote
0answers
74 views
Using C++ Boost Graph Library (BGL) in Delphi 7
In the large Delphi 7 project which I maintain, data is represented in a graph structure which takes an exponential amount of time to solve as the number of edges increases.
I know that the graph can ...
0
votes
0answers
37 views
Using vertex_name when reading a GraphML file with Boost Graph
I am trying to load a simple GraphML file such that each vertex has a vertex name as stored in the GraphML. I can change the GraphML, the important thing is that I have access to the vertex_name from ...
0
votes
0answers
33 views
using r_c_shortest path with custom graph (boost)
i'm tring to use the boost graph function r_c_shortest_paths using a graph defined by me.
here the graph and some definitions (in file graphs2.h):
#ifndef GRAPHS2_H
#define GRAPHS2_H
#include ...
0
votes
1answer
70 views
Can anybody give me an example of use the smallest_last_vertex_ordering in boost::graph?
I am new in boost programming, but i hope to use the boost graph lib on vertex coloring.
I have read the help doc and source code of smallest_last_vertex_ordering in ...
0
votes
2answers
64 views
Boost Graph Library A* for consistent heuristic
I've read that, when applying A* to a problem, if your heuristic is consistent then you can further optimize the A* search. The Boost Graph Library offers two versions of the A* algorithm: ...
3
votes
2answers
143 views
Why is Boost Graph Library's `source()` a global function?
I understand that in generic programming, algorithms are decoupled from containers. So it would make no sense to implement a generic algorithm as an instance method (the same algorithm should work on ...
1
vote
2answers
121 views
How to record all the shortest paths from a source vertex to a destination vertex
I'm currently using Boost graph library's dijkstra algorithm http://www.boost.org/doc/libs/1_53_0/libs/graph/doc/dijkstra_shortest_paths.html to compute shortest distance path between a pair of ...
0
votes
0answers
35 views
Is it possible to change breadth first search termination condition in BGL?
I am new to BGL(boost graph library). I am learning the breadth_first_search interface and it looks handy. However, in my application, I need to cut the breadth_first_search when some other ...
1
vote
1answer
67 views
How to adapt a boost::property_map in order to use it like a ublas::vector?
I am looking for a smart way to use the Boost Graph Library in conjunction with Boost uBLAS. More precisely, I need to update a given vertex property for each vertex by using the result of the scalar ...
1
vote
1answer
87 views
Extract the adjacency matrix from a BGL graph
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 ...
1
vote
0answers
99 views
Boost Graph read_graphml & dynamic vertex properties
I have use the boost graph library and read in a graph from a graphml such as this:
<?xml version="1.0" encoding="UTF-8"?>
<graphml xmlns="http://graphml.graphdrawing.org/xmlns"
...
1
vote
0answers
59 views
How to create a PropertyMap for a boost graph using listS as vertex container?
I have a boost graph defined as
typedef boost::adjacency_list<boost::setS, boost::listS,
boost::undirectedS, CoordNode, CoordSegment> BGraph;
typedef ...
2
votes
0answers
46 views
boost::edge causing segfault
I'm trying to use the boost graph library, and I'm getting a segfault when I try to use boost::edge(). The full code is available here, but here I've made a minimal program that has the same issue ...
1
vote
0answers
64 views
Accessing a attribute after my graph visitor is finished
I have a problem using the breadth first search from the boost graph library.
I want to get an attribute of my visitor class after the visit of my graph is finished.
// init my visitor
BfsVisitor bv;
...
