From dfbb2faaac3acb9b90c2adb472a3bb429ebded05 Mon Sep 17 00:00:00 2001
From: Du Shiqiao <lucidfrontier.45@gmail.com>
Date: Mon, 20 Mar 2023 23:56:50 +0900
Subject: [PATCH] update README and bump version

---
 Cargo.toml | 2 +-
 README.md  | 4 ++--
 2 files changed, 3 insertions(+), 3 deletions(-)

diff --git a/Cargo.toml b/Cargo.toml
index 9b1e522..cb4e181 100644
--- a/Cargo.toml
+++ b/Cargo.toml
@@ -6,7 +6,7 @@ keywords = ["combinatorial", "optimization", "tree", "graph"]
 license-file = "LICENSE"
 readme = "README.md"
 categories = ["algorithms"]
-version = "0.1.1"
+version = "0.2.0"
 edition = "2021"
 authors = ["Du Shiqiao <lucidfrontier.45@gmail.com>"]
 
diff --git a/README.md b/README.md
index 33adfab..a34464f 100644
--- a/README.md
+++ b/README.md
@@ -84,10 +84,10 @@ fn main() {
     let lower_bound_fn = |n: &Node| {
         let current_profit = total_profit(n);
         let max_remained_profit: u32 = profits[n.len()..].into_iter().sum();
-        u32::MAX - (current_profit + max_remained_profit)
+        Some(u32::MAX - (current_profit + max_remained_profit))
     };
 
-    let cost_fn = |n: &Node| u32::MAX - total_profit(n);
+    let cost_fn = |n: &Node| Some(u32::MAX - total_profit(n));
 
     let leaf_check_fn = |n: &Node| n.len() == total_items;