Skip to content

2.2.0

Latest
Latest
Compare
Choose a tag to compare
@backtracking backtracking released this 11 Apr 07:01
· 3 commits to master since this release
2.2.0
7100076

CHANGES:

  • [Topological]: Fix topological stable sort (#149, Maxime Buyse)
  • [Path]: new module [Bfs01] to implement 0-1 BFS
  • [Classic] new functions [kneser] and [petersen] to build Kneser's
    graphs and the Petersen graph
  • [Oper] fixed transitive reduction (#145, reported by sim642)
    and tests for transitive reduction!
  • new example depend2dot to turn make-like dependencies
    into a DOT graph, with transitive reduction
  • [Graphviz]: added PosPinned to type NeatoAttributes.vertex
  • [Oper]: improved efficiency of intersect
    (#136, reported by Ion Chirica)
  • [Path.Check]: improved efficiency with a better use of the cache
    (#125 by Paul Patault)
  • [Cycles.Johnson]: Enumerate elementary cycles (Johnson, 1975)
    (contributed by Timothy Bourke)
  • [Traverse.Bfs]: new function {fold,iter}_component_dist to
    perform a breadth-first traversal with the distance from the source
Assets 3
Loading