Boost Users :
From: Doug Gregor (dgregor_at_[hidden])
Date: 2005-07-07 16:04:00
On Jul 7, 2005, at 3:41 PM, Elisha Berns wrote:
> Thanks for the reply. As I am still relatively a novice at graph
> algorithms I am still trying to decipher parts of your response.
> Regarding your suggestion to modify the topological sort code, it looks
> like only the topological sort visitor needs modification, and
> just removing the exception throwing. Anyways this is what I came up
> with, best_case_topological_sort method that just stores the back edges
> should they be needed later. It looks like this (comments please if
> this is what you intended):
It looks fine to me.
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