Skip to content

"Free" improvement of path-check efficiency#125

Merged
backtracking merged 2 commits intobacktracking:masterfrom
paulpatault:check-path-efficiency
Feb 15, 2024
Merged

"Free" improvement of path-check efficiency#125
backtracking merged 2 commits intobacktracking:masterfrom
paulpatault:check-path-efficiency

Conversation

@paulpatault
Copy link
Contributor

No description provided.

@paulpatault paulpatault changed the title "Free" improvement of path-check efficiency [DRAFT] "Free" improvement of path-check efficiency Jun 8, 2022
@paulpatault paulpatault force-pushed the check-path-efficiency branch from e45d321 to c0b10dc Compare June 8, 2022 17:00
@paulpatault paulpatault changed the title [DRAFT] "Free" improvement of path-check efficiency "Free" improvement of path-check efficiency Jun 8, 2022
@paulpatault paulpatault force-pushed the check-path-efficiency branch from c0b10dc to 8509dec Compare June 8, 2022 17:30
@paulpatault paulpatault force-pushed the check-path-efficiency branch 2 times, most recently from 6d4550d to 17c4d2b Compare February 15, 2024 14:59
@backtracking
Copy link
Owner

Thanks!

@backtracking backtracking merged commit 77baee3 into backtracking:master Feb 15, 2024
backtracking added a commit to backtracking/opam-repository that referenced this pull request Apr 11, 2025
CHANGES:

  - [Topological]: Fix topological stable sort (backtracking/ocamlgraph#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 (backtracking/ocamlgraph#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`
    (backtracking/ocamlgraph#136, reported by Ion Chirica)
  - [Path.Check]: improved efficiency with a better use of the cache
    (backtracking/ocamlgraph#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
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants