Newbie: Boost Graph example request
Hello all. I'm new to using the Boost Graph library and am bewildered by its (seemingly essential) complexity. A solution to the simplistic problem I pose below would help provide a workable context around which to wrap my brain and would be most appreciated. -- Let G be the undirected graph given by the following adjacency list: 0 -> 2, 3 1 -> 2, 4 2 -> 3, 4 3 -> 1 4 -> 3 5 -> 0 6 -> 7 7 -> 8, 9 9 -> 10 Using, say, a breadth first search, for any two random nodes in the graph print the shortest path between them. For example, the shortest path between 5 and 3 is: 5 -> 0 -> 3 My apologies if a similar question has been asked before. A search through the mailing list archive did not return promising results. Also, I have, incidentally, ordered The Boost Graph Library text and am very much looking forward to its arrival. Thank you. Brian Troutwine
I'm new to using the Boost Graph library and am bewildered by its (seemingly essential) complexity. A solution to the simplistic problem I pose below would help provide a workable context around which to wrap my brain and would be most appreciated.
My apologies if a similar question has been asked before. A search through the mailing list archive did not return promising results. Also, I have, incidentally, ordered The Boost Graph Library text and am very much looking forward to its arrival.
Did you read the online documentation? It has an example that is nearly identical to the question you're asking. http://www.boost.org/doc/libs/1_40_0/libs/graph/doc/kevin_bacon.html Andrew Sutton andrew.n.sutton@gmail.com
Did you read the online documentation? It has an example that is nearly identical to the question you're asking.
http://www.boost.org/doc/libs/1_40_0/libs/graph/doc/kevin_bacon.html
Quite right. In my inexperience I did not recognize the example for what it was.
Thank you, Andrew.
--
Brian
On Mon, Oct 5, 2009 at 5:51 AM, Andrew Sutton
I'm new to using the Boost Graph library and am bewildered by its (seemingly essential) complexity. A solution to the simplistic problem I pose below would help provide a workable context around which to wrap my brain and would be most appreciated.
My apologies if a similar question has been asked before. A search through the mailing list archive did not return promising results. Also, I have, incidentally, ordered The Boost Graph Library text and am very much looking forward to its arrival.
Did you read the online documentation? It has an example that is nearly identical to the question you're asking.
http://www.boost.org/doc/libs/1_40_0/libs/graph/doc/kevin_bacon.html
Andrew Sutton andrew.n.sutton@gmail.com
_______________________________________________ Boost-users mailing list Boost-users@lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users
participants (2)
-
Andrew Sutton -
Brian Troutwine