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 and spirit

Can Someone Please explain this Last line? I need to eventually determine if two vertexes are connected. include include include include…
user8793459
  • 1
  • 1
0
votes
0 answers

How to use vertex_index_t on Boost Graph Library?

I know this is a very simple question, but I've been searching it for a long time and I haven't found the simple answer. I have defined an adjacency_list matrix in this form: typedef adjacency_list Network; which…
sepante
  • 15
  • 7
0
votes
3 answers

Best-First search in Boost Graph Library

I am starting to work with boost graph library. I need a best-first search, which I could implement using astar_search by having zero costs. (Please correct me if I'm wrong.) However, I wonder if there is another possibility of doing this? If the…
Philipp
  • 11,549
  • 8
  • 66
  • 126
0
votes
1 answer

Boost Graph Library turn restrictions or turn penalties

I am looking for a way to include turn restrictions and/or turn penalties in my application of Boost Graph Library, using a directed graph. I need to restrict for instance U-turns (which can be a very high penalty if that is the best way). I cannot…
WiBu
  • 34
  • 6
0
votes
0 answers

What algorithm can be used for finding subgraphs which satisfy constraints?

I'm using Boost Graph and want to find a way to identify sequences (subgraphs) within a graph which follow a specific pattern. I think of my subgraph as a pattern or template. The actual graph contains nodes with parts of strings and parsed data;…
Felix Dombek
  • 13,664
  • 17
  • 79
  • 131
0
votes
2 answers

Random order iteration over BGL vertices

Here's some example code to create a graph with bgl and iterate over the vertices. I would like to do this iteration in random order - in other words: the loop should manipulate every vertex, but the order of the vertices should be random for every…
nevrome
  • 1,471
  • 1
  • 13
  • 28
0
votes
0 answers

Boost Graph Library - Improve vertex initialization speed?

I have a graph with 5811 vertices; only known at run-time and thus could be anything but usually less than 6000. Initializing the vertices takes up a lot of time at 35 milliseconds. I was wondering if anyone has a suggestion on how I can improve…
Kong
  • 2,202
  • 8
  • 28
  • 56
0
votes
1 answer

Boost-Graph Accessing the label of an edge

I was using boost graph and it seems that I don't understand it very well. To access the label of a vertex it seems to be all right to use get(vertex_name, graph_) and then access it with the [ ]. But how can I access the label of a edge. I tried to…
Gleipnir
  • 53
  • 6
0
votes
0 answers

how to find the largest cycles in an undirected graph?

In the context of boost-graph, i am using undirected_dfs to find the cycles of the undirected graph. It works well and fast. Unfortunately, undirected_dfs does not provide the cycles based on the "basic cycles". In the example below, the 2 basic…
alvaro562003
  • 678
  • 1
  • 6
  • 27
0
votes
0 answers

undirected_dfs & make_predecessor_recorder : compilation error

My goal is to detect cycles in an undirected graph. I try to adapt the djiskra shortest path with predecessor_recorder and predecessor map to the undirected_dfs. I use the code available here…
alvaro562003
  • 678
  • 1
  • 6
  • 27
0
votes
2 answers

Passing only an element of a std::vector property to a BGL algorithm

I have a graph with multiple edge weightings stored as namespace boost { enum edge_weightvector_t { edge_weightvector = 1337 }; BOOST_INSTALL_PROPERTY(edge, weightvector); } typedef boost::adjacency_list< boost::vecS, …
Etan
  • 17,014
  • 17
  • 89
  • 148
0
votes
0 answers

Way to indicate number of iterations in BGL

I'm writing an C++ application that uses boost graph library. I use kruskal_minimum_spanning_tree function in BGL. Are there any ways to check how many times does this function iterate, because application hangs at this function? Update. I have a…
V. Inoz
  • 1
  • 2
0
votes
0 answers

Most efficient strategy for maximum-distance search of all-pairs shortest paths with graph-tool?

I am working with large weighted undirected graphs and need to calculate a form of betweenness and closeness up to a certain maximum distance. What is the most efficient way to go about maximum-distance search of all-pairs shortest paths with…
songololo
  • 4,724
  • 5
  • 35
  • 49
0
votes
1 answer

Create a custom property map

I'm trying to use the write_graphml function from the Boost Graph Library. The relevant things to know are that this function takes in a dynamic property map composed of property maps for each vertex and edge property, and assumes that all…
anderspitman
  • 9,230
  • 10
  • 40
  • 61
0
votes
1 answer

Yet another issue with BGL Deserialization

I'm trying to both serialize and deserialize the data in a graph format. The definition of my graph is the following one. #include #include #include…
jackb
  • 695
  • 8
  • 26
1 2 3
…
45 46