knapsack

Golang implementation of several classic algorithms for knapsack problem.

· Bug · Request Feature

Table of Contents

About The Project

This repository is for for the knapsack problem and optimized course.

Algorithm content

• 0-1 KP
• Bounded KP
• Unbunded KP
• Two-dimensional Cost KP
• Two-dimensional Bin Packing

Getting Started

To get a local copy up and running follow these simple steps.

Prerequisites

This is an example of how to list things you need to use the software and how to install them.

Usage

1. Clone the knapsack

   git clone https://github.com/CausingBrick/knapsack.git
   

2. Enter the subfolder just run it

   go test -run=.
   

Contributing

Contributions are what make the open source community such an amazing place to be learn, inspire, and create. Any contributions you make are greatly appreciated.

1. Fork the Project
2. Create your Feature Branch (git checkout -b feature/AmazingFeature)
3. Commit your Changes (git commit -m 'Add some AmazingFeature')
4. Push to the Branch (git push origin feature/AmazingFeature)
5. Open a Pull Request

License

Distributed under the MIT License. See LICENSE for more information.

Contact

CausingBrick - mengshengwu@outlook.com

Project Link: https://github.com/CausingBrick/knapsack