Basic Conversion to Boost Graph Library Data Structure
I know that what I'm asking is in the documentation, but I haven't been able to figure it out from just looking through it on a couple passes. I would like to convert my graph adjacency list to the BGL adjacency_list. Each node is represented with the Node data structure, and so is each edge. I also have "global" properties for the graph as a whole. So here are the three data structures my graph uses: GraphNode { int foo; double bar; } GraphEdge { double weight; bool fun; } GraphGlobals { string graphName; } How do I declare an adjacency_list that will uses these representations of the node, edge, and global parameters? Thanks. -- View this message in context: http://www.nabble.com/Basic-Conversion-to-Boost-Graph-Library-Data-Structure... Sent from the Boost - Users mailing list archive at Nabble.com.
I know this question must be simple enough for basically most people here to know the answer. Lend a newbie a hand ; - ) -- View this message in context: http://www.nabble.com/Basic-Conversion-to-Boost-Graph-Library-Data-Structure... Sent from the Boost - Users mailing list archive at Nabble.com.
participants (2)
-
Dmitry Bufistov
-
Lex Fridman