Boost logo

Boost Users :

From: Dmitry (dmitry_at_[hidden])
Date: 2006-12-08 12:33:27


Dear all,
For a some time I've been using my own implementation for calculating of the
minimum cycle ratio of the directed multigraph, it based on the approach
described in the paper
"Numerical Computation of Spectral Elements in MAX-PLUS algebra" and seems
has complexity close to linear in the respect of the edges number (both in
memory and time).

Does current BGL has some solutions for cycle ratio problem? I would like to
try to contribute my "perfect" implementation to BGL if it's possible. What
is need to be done for it?

WBR,

Dima.


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