diff --git a/CHANGELOG.md b/CHANGELOG.md index 2d0af46b..769c5490 100644 --- a/CHANGELOG.md +++ b/CHANGELOG.md @@ -1,5 +1,5 @@ -n.n.n / 2025-01-15 +v4.13.1 / 2025-01-15 ================== * fix(perf): back out commit 808b951c5a9eb5dd25adbd46a5887525d0a0913d which causes a severe performance regression in Dijkstra algorithm diff --git a/Cargo.toml b/Cargo.toml index 21e616d2..c705dbd8 100644 --- a/Cargo.toml +++ b/Cargo.toml @@ -6,7 +6,7 @@ keywords = ["shortest-path", "astar", "dijkstra", "flow", "graph"] license = "Apache-2.0/MIT" homepage = "https://rfc1149.net/devel/pathfinding.html" documentation = "https://docs.rs/pathfinding/" -version = "4.13.0" +version = "4.13.1" authors = ["Samuel Tardieu "] categories = ["algorithms"] readme = "README.md" diff --git a/README.md b/README.md index ae33c684..c3c93738 100644 --- a/README.md +++ b/README.md @@ -12,7 +12,7 @@ In your `Cargo.toml`, put: ``` ini [dependencies] -pathfinding = "4.13.0" +pathfinding = "4.13.1" ``` You can then pull your preferred algorithm (BFS in this example) using: