31 Mar
2009
31 Mar
'09
1:55 p.m.
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. Cheers, Brook