|
Boost Users : |
From: David Abrahams (dave_at_[hidden])
Date: 2008-07-09 12:11:00
on Wed Jul 09 2008, "Christiaan Putter" <ceputter-AT-googlemail.com> wrote:
> Hi guys and girls,
>
> I've got an existing Graph structure, consisting of node and edge
> classes. The graph structure itself is implicit in the sense that
> every node contains a list of out edges, and edges know where they
> start from and go to.
>
> I'm using Qt's container classes for simplicity mostly, eg. a node has
> a QList of successors (QList<Edge*>), and all the nodes and edges get
> stored in a Network class using QHash<Node*> etc...
>
> I've been trying to extend this to work with the BGL, following the
> LEDA and SGB examples.
>
> As far as I know I can simply use the BGL functions on an instance of
> my own Network, ie. no need to recreate the graph. Is this correct?
Yes, that's what makes BGL a generic library :-)
-- Dave Abrahams BoostPro Computing http://www.boostpro.com
Boost-users list run by williamkempf at hotmail.com, kalb at libertysoft.com, bjorn.karlsson at readsoft.com, gregod at cs.rpi.edu, wekempf at cox.net