Stack Overflow
Stack Overflow

Questions tagged [boost-graph]

Boost.Graph is a C++ library containing generic graph components and algorithms.

Boost.Graph is a C++ library containing generic graph components and algorithms.

680 questions
0
votes
1 answer

Boost Graph initialize_vertex change vertex color (visitor)

I would like to build a visitor (for dikstra) with the initialise_vertex acting as 'colour map' modifier. I want to exclude some vertices from the search based on a condition. So I want to set some vertices 'black' in the init part of the…
OHTO
  • 313
  • 3
  • 15
0
votes
1 answer

VAO + VBOs logic for data visualization (boost graph)

I'm using the Boost Graph Library to organize points linked by edges in a graph, and now I'm working on their display. I'm a newbie in OpenGL ES 2/GLKit and Vertex Array Objects / Vertex Buffer Objects. I followed this tutorial which is really…
Benoît Lahoz
  • 1,270
  • 1
  • 18
  • 43
0
votes
1 answer

How to read in a starting vertex?

I'm working on a project to find the shortest path in a graph, and I must be able to specify the start and end vertices. I've got most of it done using Boost, but I have one question left. How do I specify the start vertex? Here's my code. If you…
user2896852
  • 57
  • 1
  • 6
0
votes
1 answer

Query a complete directional graph to determine downstream/upstream relationship and distance

Assuming that I've already constructed a graph using the Boost graph library to represent a complete directed graph, how would someone query the graph, given a set [node_a,node_b] to determine if node_b is "downstream" from node_a and by what…
gcolumbus
  • 127
  • 1
  • 10
0
votes
1 answer

struggling to implement simple boost::graph traversal

I'm struggling to implement a simple boost::graph. I've tried to read all the documentation I can find and examples etc... Here is my code (copied from other examples on StackOverflow) The vertex: class customvertex { public: double…
Ken Moynihan
  • 135
  • 6
0
votes
2 answers

Find all linesegments=edges within a certain distance to a point in a graph, how to combine boost-graph with boost-geometry?

I have a set of user paths (2 dim) in a game setup that are modelled as a set of lines (arcs) and waypoints = vertices. The whole set of paths can be seen as a graph where the edges are line segments that have additional properties like length,…
spinxz
  • 401
  • 3
  • 13
0
votes
0 answers

Boost graph library breadth first search yielding incorrect predecessor map

Running breadth-first search on an unweighted, directed graph on 2 vertices where each vertex is connected to the other yields a predecessor map where the source of the breadth-first search is not its own predecessor. The following program is…
Sam
  • 417
  • 1
  • 6
  • 13
0
votes
1 answer

Disable unused variable warning from Boost graph library within CMake

I only want to disable unused variable warnings from BGL, and keep such warnings for my own code. I have read similar answers suggesting include boost as system header, but I don't know how to do that in CMake...
LittleSweet
  • 534
  • 2
  • 6
  • 9
0
votes
2 answers

Boost GraphML reader and yEd

I am trying to read a .graphml that yEd (yEd) generates. I am able to read simple and manually-generated .graphml files but the yEd files contains several properties to be defined. Does any one has a running example that show how to deal with such…
GDG
  • 397
  • 5
  • 14
0
votes
1 answer

BGL : How do I get a list of subgraphs, given a graph?

I have a boost adjacency_list, which is my main graph. To this graph, I added some subgraphs using the create_subgraph function. My question is, how can I get the list of subgraphs I just created without storing the Graph objects? eg: Graph g; //…
YshfOp
  • 1
  • 2
0
votes
1 answer

how to read graph-domain attributes with boost::read_graphml?

Probably a silly question, but I can't find any answer online. My application reads a topology from a custom file and builds a boost::graph out of it. I'm in the process of moving to a more standard graphml representation. I can read/write node…
manuhalo
  • 165
  • 1
  • 8
0
votes
1 answer

Error using property map in boost graph library

i have the following code typedef property > edge_properties; typedef property vertex_properties; typedef adjacency_list…
vigenere
  • 197
  • 3
  • 15
0
votes
0 answers

Does boost graph really need 40 MB of files?

I want to use boost graph and so I've extracted it with bcp. The thing is it's copied almost 40 MB of files. It seems like a lot to me, but I really don't know. I guess there are lots of things for different platforms and many things I probably…
MikMik
  • 3,426
  • 2
  • 23
  • 41
0
votes
1 answer

How to find the shortest path between two vertives in a graph?

I am making a GPS system for a game, which will allow you to pick the shortest path between two point on the roads. As for now I hae made a class which looks as follows: #include #include…
user1182183
0
votes
2 answers

How to output a directed graph in graphml format?

How would I output the following graph into graphml? typedef struct Vertex{ std::string name; std::string cmdb_id; Vertex& operator= (const Vertex& rhs) { if (this == &rhs) …
bayerb
  • 649
  • 2
  • 9
  • 28
1 2 3
…
45 46