Re: [Boost-users] a little Graph guidance (looking for hints)

From: Carsten Høyer (hallo_at_[hidden])
Date: 2008-08-25 03:13:49

On Søn, August 24, 2008 18:45, Raindog wrote:
> Carsten Hoyer wrote:
>
>> Hi
>> Just turned to Boost - What a fantastic library :)
>>
>>
>> I have a question about the construction of a Graph. I can't figure out how
>> to use boost to represent a graph where each Vertex has several outs. F.ex Vertex 1
>> has out 1, 2 and 3. Vertex A has in a, b and c. I can then make edges going from
>> 1-a, 1-b, 2-b etc. Like F.ex
>> http://messe.harmony-central.com/Musikmesse05/Content/Native_Instruments/PR/Reakto
>> r-5-interface-lg.jpg Reaktor
>>
>>
>> Any hints?
>> Thank you
>> Carsten
>>
>>
> add_edge(node1, node2, g); add_edge(node1, node3, g); add_edge(node1, node4, g);

That wouldn´t be enough would it? Then i only have the connection between the two
nodes, but i need a little more information embedded. Every node has a sub-input and
sub-output. So it should be something like add_edge(node1, output1, node3, input1,
g); Which, as i write it, makes me think i should derive a class from the kind of
list i choose to implement the graph with. Right?