Lars Gullik Bjønnes wrote:
> I implore you to have a look at the boost graph library before you
> implement these graph algorithms.
Well, a little late, moreover:
>
> www.boost.org
>
> Generic data structures created specifically for LyX (lists, vectors,
> etc.) is something I am very wary of...
>
Arggh.... :
> Re: converter.C
> From:
> Andre Poenitz <[EMAIL PROTECTED]>
> Date:
> Wednesday 26 February 2003 09:54:30
> Groups:
> gmane.editors.lyx.devel
> References: 1 2 3
>
> On Wed, Feb 26, 2003 at 09:45:06AM +0100, Alfredo Braunstein wrote:
> > Andre Poenitz wrote:
> >
> > > I think I have some code flying around that implement shortest path
> > > searches. Interested?
> >
> > Absolutely, but:
> >
> > If you think it's ok, I would try to make the separation first without
> > changing the existing code.
>
> Sure.
>
> > Once I have this working, we can think of
> > changing the graph code (we can even consider putting boost.graph if we
> > feel greedy).
>
> Nah. Overkill.
>
> > Send it anyway if you have it at hand.
>
Ok, if you are really sure that you want that, can you 'install' boost.graph
in the lyx tree? I will give it a try.
Thanks,
Alfredo
