|
Boost : |
Subject: Re: [boost] [GSoC 2010]: BGL Graph Connectives ideas
From: Andrew Sutton (andrew.n.sutton_at_[hidden])
Date: 2010-04-02 17:40:36
> I have some ideas about implementing graph connectives. I think that the
> best way to implement first four binary operations (union, join,
> intersection and difference) is to use adjacency matrices.
>
I think variants of these algorithms for non-adjacency matrices are just as
important. It would be best to focus on these problems and their generic
solution than to propose more solutions for a smaller set of graphs.
Andrew Sutton
andrew.n.sutton_at_[hidden]
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk