C
Chris Gordon-Smith
I have recently started using the Boost Graph Library(BGL);
overall I am finding it excellent and very powerful.
One thing worries me a little. It seems to be standard practice
when using BGL to create a data structure with a specific size,
and then pass a pointer (or iterator) to the start of that data
structure to an algorithm as an argument.
Is this OK? Isn't it better to dynamically allocate memory for
containers according to need, or am I missing the point?
overall I am finding it excellent and very powerful.
One thing worries me a little. It seems to be standard practice
when using BGL to create a data structure with a specific size,
and then pass a pointer (or iterator) to the start of that data
structure to an algorithm as an argument.
Is this OK? Isn't it better to dynamically allocate memory for
containers according to need, or am I missing the point?