Boost.Graph is a C++ library containing generic graph components and algorithms.
Boost.Graph is a C++ library containing generic graph components and algorithms.
Questions tagged [boost-graph]
680 questions
-1
votes
1 answer
create graph by knowing the vertex (name) and connection between these
I have a list of vertices as a big array which are:
vert[N]
100, 1350, 200, 400, 12000, ....
It means that the labels are saved in an array which is : v[1]=100, v[2]=1350, v[3]=200, v[4]=400, v[5]=12000, ....
and I also know the…
ziv
- 189
- 1
- 9
-1
votes
1 answer
Level ordered traversal of a boost graph
I'm new to the boost graph library and given a directed graph, I'd like to build a level ordered vector of vertices, i.e. given vertices A,B,C,D,E,F and edges
A->B, A->C, B->D, C->E and E->F
get a vector of vertices which are at the same depth in…
-1
votes
1 answer
Please help me with Boost Graph Library
I want to use the dense_boruvka_minimum_spanning_tree function in Boost Graph Library, C++. What I want to do is to generate a random graph and then input it into that function to run the Boruvka's algorithm in parallel. Could anybody help me with…
Logan Yang
- 2,364
- 6
- 27
- 43
-2
votes
1 answer
Boost Adapter class to convert matrix to to graph
I need to find out the shortest path between two nodes in a 2D array. For that i would like to use boost graph library. But the boost graph library accepts graph as input. So i need to convert 2D array to graph. I have also heard that an adapter…
Praveen V
- 11
-3
votes
2 answers
strangeness in the work of the Bellman-ford algorithm
I can not understand what's wrong if specify -log () weight shows a "negative loop". if remove log (), the algorithm works, but there is no negative cycle
int main() {
typedef double Weight;
typedef property…
jonB
- 1
- 1