diff --git a/CHANGELOG.md b/CHANGELOG.md
index 003ee6ab..eb0a8fff 100644
--- a/CHANGELOG.md
+++ b/CHANGELOG.md
@@ -1,5 +1,5 @@
 
-n.n.n / 2024-08-31
+v4.11.0 / 2024-08-31
 ==================
 
   * feat(prim): add Prim's algorithm for finding MST
diff --git a/Cargo.toml b/Cargo.toml
index f65e3b84..abab32ca 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.10.0"
+version = "4.11.0"
 authors = ["Samuel Tardieu <sam@rfc1149.net>"]
 categories = ["algorithms"]
 readme = "README.md"
diff --git a/README.md b/README.md
index 847559f5..80a438c3 100644
--- a/README.md
+++ b/README.md
@@ -12,7 +12,7 @@ In your `Cargo.toml`, put:
 
 ``` ini
 [dependencies]
-pathfinding = "4.10.0"
+pathfinding = "4.11.0"
 ```
 
 You can then pull your preferred algorithm (BFS in this example) using: