Knapsack Application Solver using Backtracking

This Flutter application provides a solution to the Knapsack problem using the backtracking algorithm. The Knapsack problem is a combinatorial optimization problem, which involves selecting a subset of items with given weights and values to maximize the total value without exceeding a given weight limit.

Features

• Input fields for item weights and values
• Dynamic addition and removal of items
• Calculates the maximum value that can be carried in the knapsack
• User-friendly interface with real-time calculations

Getting Started

Prerequisites

• Flutter SDK: >=2.7.0 <3.0.0
• Dart SDK

Dependencies

The main dependencies used in this project are:

• cupertino_icons: ^1.0.2
• rxdart: ^0.26.0
• scoped_model: ^1.1.0

Installation

1. Clone the repository:

   git clone https://github.com/adnanAlKharfan/knapsack-application-solver-using-backtracking.git
   cd knapsack-application-solver-using-backtracking

2. Install dependencies:

   flutter pub get

3. Run the application:

   flutter run

Contributing

Contributions are welcome! Feel free to open issues or submit pull requests.

Contact

For any inquiries or support, please contact Adnan AlKharfan.