Andre Poenitz wrote:
> I don't know. My own project is graph related stuff and at the time we
> checked available implementations boost::graph just did not cut it. [We
> can't affort O(n) operations for any of edge/node insertion/deletion and
> edge contraction and boost::graph had that in some cases]
It seems that things have changed since then, looking at the documentation.
>> Ah well, then make it 74 lines ;). And it's still pseudocode.
>
> Well, it was more or less "production code".
I know that. It was you that started. ;)
> The question is not if your or my code is shorter but how much an
> interface to boost::graph would cost us.
Yes, don't get me wrong. I was only nitpicking because you said that 20
lines thingy. And no way I was competing in that sense, as my code includes
yours (I'm not so dumb, you know). I was only pointing out that those 75
lines (+ a 10 lines bfs) are more or less the only 'real' code we need, the
rest is more or less interface.
> Andre'
I've just downloaded the boost graph library and I'll give it a shot.
There's always time to give up.
Regards,
Alfredo
