Posted
by Sunny
on Stack Overflow
See other posts from Stack Overflow
or by Sunny
Published on 2009-04-24T11:20:07Z
Indexed on
2010/03/24
18:03 UTC
Read the original article
Hit count: 202
If my BGL graph contain edge from node x to node y, and I want to change the target of this edge, so that now it's pointing from x to z, how it can be done?
Are there any functions in BGL for that?
© Stack Overflow or respective owner
as seen on Stack Overflow
- Search for 'Stack Overflow'
I am investigating the use of the boost graph libraries in order to apply them to various network problems I have in mind.
In the examples I have been looking at the graph edge values ("weights") are always initialized as integers, such as in these Bellman-Ford and Kruskal algorithms eg:
int weights[]…
>>> More
as seen on Stack Overflow
- Search for 'Stack Overflow'
Can anyone please tell me that once I've created a graph using Boost Graph library, how can I display that graph?
My biggest concern is that the edge weights are coming from an exernal data source over the network. And I need to be able to display the edgeweights live as they get updated.
>>> More
as seen on Stack Overflow
- Search for 'Stack Overflow'
I want to find in an adjacency graph from the bgl how give a Vertexdescriptor and get the set of nodes that are parents of this given node.
i would like to do this in directed graph, it seems you could use a bidirectional graph but i want to be able to restrict it so that there are no cycles.
>>> More
as seen on Stack Overflow
- Search for 'Stack Overflow'
Hi,
Sorry if this is a very basic questions for some of you but I'm new to C++ (let alone Boost Graph Library) and couldn't figure out this problem. So far I've been able to formulate/gather code to create a graph using the code below.
Now I'm trying to figure out the code to find the longest…
>>> More
as seen on Stack Overflow
- Search for 'Stack Overflow'
I am trying to figure out how to use boost::graph to store some information. However, there is information I want tied to each vertex. Staring at the documentation for the library reveals either(a)badly written documentation, or (b), I'm obviously not as good at C++ as I thought. Pick two.
I am looking…
>>> More
