{"id":21135821,"url":"https://github.com/sionpardosi/knapsack-algoritma-backtracking","last_synced_at":"2026-01-02T14:03:54.278Z","repository":{"id":260041670,"uuid":"863268509","full_name":"sionpardosi/Knapsack-Algoritma-Backtracking","owner":"sionpardosi","description":"App Knapsack dengan Algoritma Backtracking","archived":false,"fork":false,"pushed_at":"2024-11-23T06:40:58.000Z","size":10,"stargazers_count":31,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-01-21T06:43:38.566Z","etag":null,"topics":["backtracking-algorithm"],"latest_commit_sha":null,"homepage":"https://sionsautparulianpardosi.pythonanywhere.com/","language":"HTML","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/sionpardosi.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2024-09-26T02:25:00.000Z","updated_at":"2024-12-05T13:37:28.000Z","dependencies_parsed_at":"2024-10-29T07:29:04.469Z","dependency_job_id":"6bd7f065-2c9b-4628-a4a9-09c7c0632a87","html_url":"https://github.com/sionpardosi/Knapsack-Algoritma-Backtracking","commit_stats":null,"previous_names":["sionpardosi/knapsack-algoritma-backtracking"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sionpardosi%2FKnapsack-Algoritma-Backtracking","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sionpardosi%2FKnapsack-Algoritma-Backtracking/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sionpardosi%2FKnapsack-Algoritma-Backtracking/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sionpardosi%2FKnapsack-Algoritma-Backtracking/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/sionpardosi","download_url":"https://codeload.github.com/sionpardosi/Knapsack-Algoritma-Backtracking/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":243581063,"owners_count":20314163,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["backtracking-algorithm"],"created_at":"2024-11-20T06:58:44.186Z","updated_at":"2026-01-02T14:03:54.272Z","avatar_url":"https://github.com/sionpardosi.png","language":"HTML","funding_links":[],"categories":[],"sub_categories":[],"readme":"# App Knapsack Problem with Backtracking\n\n### \u003csummary\u003e\u003cstrong\u003eTools:\u003c/strong\u003e\u003c/summary\u003e\n\u003cp\u003e\n    \u003cimg src=\"https://img.shields.io/badge/Language-Python-blue?logo=python\u0026logoColor=white\" /\u003e\n    \u003cimg src=\"https://img.shields.io/badge/Algorithm-Backtracking-orange?logo=python\u0026logoColor=white\" /\u003e\n    \u003cimg src=\"https://img.shields.io/badge/Library-Numpy-green?logo=numpy\u0026logoColor=white\" /\u003e\n    \u003cimg src=\"https://img.shields.io/badge/IDE-PyCharm-000000?logo=pycharm\u0026logoColor=white\" /\u003e\n    \u003cimg src=\"https://img.shields.io/badge/Tool-Jupyter%20Notebook-FFD43B?logo=python\u0026logoColor=white\" /\u003e\n\u003c/p\u003e\n\nDiberikan sejumlah item dengan berat dan nilai tertentu, serta sebuah ransel dengan kapasitas tertentu. Tugas Anda adalah memilih item-item untuk dimasukkan ke dalam ransel sehingga nilai total item-item yang dipilih maksimal, tanpa melebihi kapasitas ransel.\n\n## Batasan Tambahan:\n1. Setiap item memiliki jumlah maksimal yang dapat dipilih.\n2. Algoritma backtracking harus digunakan untuk menyelesaikan masalah ini. Tidak boleh menggunakan greedy algorithm.\n3. Setiap kombinasi item yang memungkinkan harus dieksplorasi menggunakan backtracking.\n\n## Input:\nSebuah daftar item, masing-masing item memiliki:\n1. Berat (𝑤𝑖): Berat item ke-i.\n2. Nilai (𝑣𝑖): Nilai item ke-i.\n3. Jumlah maksimal (𝑚𝑖): Jumlah maksimal item ke-i yang bisa dipilih.\n4. Kapasitas maksimal ransel (W).\n\n## Soal:\nDiberikan daftar 8 item berikut:\n\nKapasitas ransel (W): 20 kg.\n\n## Tugas:\n1. Tentukan kombinasi item yang bisa dipilih sehingga nilai total item maksimal tanpa melebihi kapasitas ransel 20 kg.\n2. Tentukan berapa unit dari masing-masing item yang dipilih untuk mencapai nilai maksimal tersebut.\n\n## Output:\n- Kombinasi item dan jumlah yang dipilih.\n- Nilai maksimum yang bisa didapatkan.\n\n## Instruksi Penyelesaian Algoritma Backtracking:\n- Eksplorasi semua kemungkinan kombinasi item. Untuk setiap item, pilih dari 0 hingga jumlah maksimal yang diperbolehkan.\n- Setiap kali memilih suatu jumlah untuk item, periksa apakah kapasitas ransel melebihi batas. Jika melebihi, lakukan backtrack.\n- Jika kapasitas tidak terlampaui, lanjutkan ke item berikutnya.\n- Simpan solusi terbaik (nilai tertinggi) yang ditemukan selama proses eksplorasi.\n\n## Langkah-langkah:\n- Mulai dengan ransel kosong dan kapasitas 20 kg.\n- Untuk setiap item, pilih antara 0 hingga jumlah maksimal item tersebut, cek apakah masih memungkinkan berdasarkan kapasitas ransel.\n- Jika memungkinkan, tambahkan nilai item ke dalam ransel, dan periksa apakah nilai total lebih baik dari solusi sebelumnya.\n- Jika kapasitas ransel terlampaui, kembalikan (backtrack) dan coba opsi lain.\n- Setelah semua kombinasi dicoba, kembalikan kombinasi item yang memberikan nilai maksimal.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsionpardosi%2Fknapsack-algoritma-backtracking","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fsionpardosi%2Fknapsack-algoritma-backtracking","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsionpardosi%2Fknapsack-algoritma-backtracking/lists"}