How bilistic/knapsack_solutions works
This repository combines a knapsack-algorithm benchmark generator with a small Flask results viewer. The principal workflow generates task sets, runs several solvers and records timing/results in an Excel workbook; the viewer reads that workbook and serves raw or per-node-count averages to a page. The README also documents comparative analysis of Greedy, Generate & Test, Branch and Bound, and Backtracking. Source excerpts do not show the template’s client-side behavior, so no browser-to-endpoint interaction is asserted.
Main entry points: Knapsack_Problem.py Benchmark runner · DataServer.py Flask routes · Main.cpp C++ solver examples · data.html HTML page
Components 11
Benchmark and solvers
- Task generation
Knapsack_Problem.py - Greedy solver
Knapsack_Problem.py - Exact solvers
Knapsack_Problem.py - Benchmark runner
Knapsack_Problem.py - Results workbook
- C++ solver examples
Main.cpp
Results viewer
- Flask routes
DataServer.py - Average aggregation
DataServer.py - HTML page
templates/data.html - Page styling
static/style2.css
Other components
- User
Connections 10
- User → Benchmark runner: runs benchmark
Knapsack_Problem.py - Benchmark runner → Task generation: generates tasks
Knapsack_Problem.py - Benchmark runner → Greedy solver: runs solver
Knapsack_Problem.py - Benchmark runner → Exact solvers: runs solvers
Knapsack_Problem.py - Benchmark runner → Results workbook: writes results
Knapsack_Problem.py - User → Flask routes: requests page/data
- Flask routes → HTML page: renders page
DataServer.py - Flask routes → Results workbook: reads workbook
DataServer.py - Flask routes → Average aggregation: computes averages
DataServer.py - C++ solver examples → C++ solver examples: implements algorithms
Main.cpp