| commit | 35a7af1126cf132d28d2100b24ee476084acd974 | [log] [tgz] |
|---|---|---|
| author | Andrew de los Reyes <adlr@chromium.org> | Wed Mar 10 16:33:26 2010 -0800 |
| committer | Andrew de los Reyes <adlr@chromium.org> | Wed Mar 10 16:33:26 2010 -0800 |
| tree | eb79de1f5bad11fd43938285789e8f6354a10386 | |
| parent | 81ebcd8a46286a19b6616a3823e575ddd6a3c2b8 [diff] |
AU: Cycle Breaker for directed graphs. A new class CycleBreaker that uses Johnson's elementary circuit finding algorithm to find cycles in a directed graph. This class goes beyond Johnson's algorithm to also break them using a simple greedy algorithm. Like Johnson's elementary circuit finding algorithm, this is not intended to find cycles that contain only one node (i.e., a node that points to itself). Review URL: http://codereview.chromium.org/784001