+2

CHANGES.md

reviewed

··· 1 1 2 2 + - [Cycles.Johnson]: Enumerate elementary cycles (Johnson, 1975) 3 3 + (contributed by Timothy Bourke) 2 4 - [Traverse.Bfs]: new function `{fold,iter}_component_dist` to 3 5 perform a breadth-first traversal with the distance from the source 4 6

+1 -1

src/cycles.mli

reviewed

··· 80 80 val fold_succ : (V.t -> 'a -> 'a) -> t -> V.t -> 'a -> 'a 81 81 end 82 82 83 83 - (** Implementation of Johnson's 1975 algoirthm for "Finding all the Elementary 83 83 + (** Implementation of Johnson's 1975 algorithm for "Finding all the Elementary 84 84 Cycles of a Directed Graph". It does not do any preprocessing, i.e., no 85 85 removal of self-loops and no dissection into strongly connected 86 86 components.