From: Paul Thompson (p.thompson_at_[hidden])
Date: 2006-11-14 17:27:33
Has anyone considered (or are there already bindings for) interactions between
boost::numeric::ublas sparse matrices and boost::graph s ?
For example, it would be useful to be able to use the boost::graph algorithms
such as shortest paths, min spanning trees but traversing though the graph
edges implied by matrix off-diagonals.
This could also be approached from the other end, defining numerical
quantities on the vertices and/or edges, then seeking to define product and