From b2e68bfc085af7cc09ece38cc9c81acb0da6e965 Mon Sep 17 00:00:00 2001
From: "AGRAR\\xavier.gillard" <xaviergillard@gmail.com>
Date: Thu, 22 Feb 2024 15:34:07 +0100
Subject: [PATCH] oops I forgot to update the readme

---
 README.md | 3 ++-
 1 file changed, 2 insertions(+), 1 deletion(-)

diff --git a/README.md b/README.md
index 9acc0d3..e3a7f68 100644
--- a/README.md
+++ b/README.md
@@ -133,7 +133,7 @@ impl Problem for Knapsack {
         }
         ret
     }
-    fn transition_cost(&self, _state: &Self::State, dec: Decision) -> isize {
+    fn transition_cost(&self, _state: &Self::State, _next: &Self::State, dec: Decision) -> isize {
         self.profit[dec.variable.id()] as isize * dec.value
     }
 
@@ -337,6 +337,7 @@ please cite:
 ```
 
 ## Changelog
++ Version 2.0.0 gives the transition_cost function an access to the target state which is reached by applying the given transition
 + Version 0.3.0 adds a cutoff mechanism which may force the solver to stop trying to prove the optimum. Some return types have been adapted to take that possibility into account.
 
 ## References