A python implementation of the Knapsack problem using dynamic programming.
Project description
Knapsack Algorithm
knapsack_algorithm is a Python package that provides a simple and efficient solution for the 0/1 knapsack problem.
Features
- Dynamic Programming Solution: Utilizes dynamic programming to solve the 0/1 knapsack problem efficiently.
- Error Handling: Provides comprehensive error handling for input validation.
- Easy to Use: Offers a user-friendly interface for solving knapsack problems with given values, weights, and capacity.
Installation:
You can install KnapsackAlgorithm using pip:
pip install knapsack_algorithm
Usage:
Here's an example of how you can use knapsack_algorithm:
from knapsack_algorithm import knapsack
Documentation
For detailed documentation and additional options, refer to the official documentation.
License
This project is licensed under the MIT License - see the LICENSE file for details.
Contributing
If you would like to contribute or report issues, please check our contribution guidelines.
Example usage:
values = [60, 100, 120] # The values of the items
weights = [10, 20, 30] # The weights of the items
capacity = 50 # The maximum capacity
result = knapsack(values, weights, capacity)
if result is not None:
print("Maximum value in the knapsack:", result)
Project details
Release history Release notifications | RSS feed
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
Built Distribution
Close
Hashes for knapsack_algorithm-1.0.0-py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | 0f16b9cd106708d43c7da4a619ef41946dfb3fd065e18aa9edc2e0ad84ffb095 |
|
MD5 | 6be983b21a8bd7c37db2c579fed7e5da |
|
BLAKE2b-256 | 85dd655484c326e0107cdf5683c1ec4a4e184b35b8eb7b41d12c680cb51f68d2 |