|
Boost Users : |
From: Erik Arner (yg-boost-users_at_[hidden])
Date: 2002-07-29 07:13:28
This is a repost - I sent it last friday but it hasn't shown up, so I'll
try again:
Is there an algorithm implemented in BGL that detects whether a directed
graph contains cycles or not? If not, what would be the best way to
implement such an algorithm?
Thanks,
Erik
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