Subject: Re: [boost] Google SoC idea - Relations
From: Brook Milligan (brook_at_[hidden])
Date: 2009-03-31 09:55:21
Andrew Sutton writes:
> My (not-so sneaking) suspicion is that Michael is actually proposing to
> build a BGL graph adaptor for function objects and develop some relation
> abstractions around that. In this case topological sort is free.
If it would be of interest I have built 2 such adaptor classes, one
for adjacency graphs and one for incidence graphs. They are important
parts of my Viterbi algorithm work.
Boost list run by bdawes at acm.org, david.abrahams at rcn.com, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk