dancealgorithm 0.1.0__tar.gz

dancealgorithm-0.1.0/LICENSE

@@ -0,0 +1,22 @@
+MIT License
+
+Copyright (c) 2026 DanceAlgorithm Maintainer
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
+

dancealgorithm-0.1.0/PKG-INFO

@@ -0,0 +1,199 @@
+Metadata-Version: 2.4
+Name: dancealgorithm
+Version: 0.1.0
+Summary: DanceAlgorithm: Instant DAA Algorithms, Lab Problem Sheets, Datasets, and Code Vault.
+Author: DanceAlgorithm Maintainer
+License-Expression: MIT
+Project-URL: Homepage, https://github.com/AdityaxDeore/dancealgorithm
+Keywords: dancealgorithm,daa,algorithms,problem-sheets,datasets,cli
+Classifier: Development Status :: 4 - Beta
+Classifier: Environment :: Console
+Classifier: Intended Audience :: Education
+Classifier: Intended Audience :: Developers
+Classifier: Operating System :: OS Independent
+Classifier: Programming Language :: Python :: 3
+Classifier: Programming Language :: Python :: 3.9
+Classifier: Programming Language :: Python :: 3.10
+Classifier: Programming Language :: Python :: 3.11
+Classifier: Programming Language :: Python :: 3.12
+Classifier: Programming Language :: Python :: 3.13
+Classifier: Topic :: Education
+Requires-Python: >=3.9
+Description-Content-Type: text/markdown
+License-File: LICENSE
+Dynamic: license-file
+
+# ⚡ DanceAlgorithm
+
+> **Instant DAA Problem Sheets, Datasets, Solutions & Algorithm Vault**  
+> Download, extract, organize, and directly **import** all 24 Design & Analysis of Algorithms (DAA) lab practical problem sheets, datasets, and Java solutions cleanly onto your PC with a single command or Python import.
+
+[![PyPI Version](https://img.shields.io/pypi/v/dancealgorithm.svg)](https://pypi.org/project/dancealgorithm/)
+[![Python Version](https://img.shields.io/badge/python-3.9%2B-blue.svg)](https://www.python.org/)
+[![License: MIT](https://img.shields.io/badge/License-MIT-yellow.svg)](https://opensource.org/licenses/MIT)
+[![Zero Dependencies](https://img.shields.io/badge/dependencies-0%20runtime-brightgreen.svg)]()
+
+---
+
+## 🌟 The Magic Experience
+
+### Option A: Install & Extract All 24 Problem Sheets to `C:\DAA_Assignments`
+
+```powershell
+pip install dancealgorithm; dance
+```
+
+Or run `dance` (or `dancealgorithm`) anytime in your terminal:
+
+```powershell
+dance
+```
+
+Your `C:\DAA_Assignments` folder is cleanly populated with all 24 problem sheets:
+
+```text
+C:\DAA_Assignments\
+├── MS - Customer/
+│   ├── dataset.csv
+│   └── Solution.java
+├── MS - Commerce/
+│   ├── dataset.csv
+│   └── Solution.java
+├── MS - Library/
+├── ...
+└── LC - Flight/
+    └── Solution.java
+```
+
+---
+
+## 🚀 Quick Terminal CLI Usage
+
+### 1. View Algorithm Notes & Time Complexities directly on screen
+
+No files extracted — instant terminal reference cheat sheets:
+
+```powershell
+# Merge Sort recurrence & analysis
+dance MS.txt
+
+# Quick Sort partition & analysis
+dance QS.txt
+
+# Dijkstra shortest path analysis
+dance DA.txt
+
+# Graph Coloring backtracking analysis
+dance GC.txt
+
+# Fractional Knapsack greedy proof
+dance FK.txt
+
+# 0/1 Knapsack dynamic programming
+dance K.txt
+
+# Multistage Graph backward DP
+dance MSG.txt
+
+# Least Cost Branch & Bound TSP
+dance LC.txt
+```
+
+*(You can also use `dancealgorithm DA.txt` or `dance DA`)*
+
+### 2. Extract a Specific Assignment Folder
+
+Extract only that particular folder:
+
+```powershell
+# Extract unquoted or quoted
+dance MSG - Logistics
+dance "DA - Smart"
+dance "GC - Classroom"
+dance "MS - Customer"
+
+# Or extract by problem number
+dance 1
+dance 13
+dance 19
+```
+
+### 3. List All Available Problem Sheets & Notes
+
+```powershell
+dance list
+```
+
+---
+
+## 🐍 Option B: Direct Python Import
+
+All 24 assignments can be directly inspected or extracted programmatically:
+
+```python
+import dancealgorithm
+
+# 1. Access code directly
+code = dancealgorithm.get("MSG - Logistics").code
+print(code)
+
+# 2. Extract a specific sheet
+dancealgorithm.extract("MSG - Logistics")
+
+# 3. Extract all sheets to custom destination
+dancealgorithm.extract(destination="D:/MyLabs")
+
+# 4. Open destination folder in Windows Explorer
+dancealgorithm.open_folder()
+```
+
+---
+
+## 📚 Complete Catalogue of All 24 DAA Problem Sheets
+
+| No. | Algorithm | Category | Problem Sheet Title | Time Complexity |
+|---|---|---|---|---|
+| **01** | Merge Sort | Divide & Conquer | `MS - Customer` | $O(n \log n)$ |
+| **02** | Merge Sort | Divide & Conquer | `MS - Commerce` | $O(n \log n)$ |
+| **03** | Merge Sort | Divide & Conquer | `MS - Library` | $O(n \log n)$ |
+| **04** | Quick Sort | Divide & Conquer | `QS - Movie` | $O(n \log n)$ avg |
+| **05** | Quick Sort | Divide & Conquer | `QS - Commerce` | $O(n \log n)$ avg |
+| **06** | Quick Sort | Divide & Conquer | `QS - Online` | $O(n \log n)$ avg |
+| **07** | Fractional Knapsack | Greedy Method | `FK - Emergency` | $O(n \log n)$ |
+| **08** | Fractional Knapsack | Greedy Method | `FK - Electric` | $O(n \log n)$ |
+| **09** | Fractional Knapsack | Greedy Method | `FK - Advertisement` | $O(n \log n)$ |
+| **10** | Dijkstra | Shortest Path | `DA - Smart` | $O(V^2)$ / $O(E \log V)$ |
+| **11** | Dijkstra | Shortest Path | `DA - Campus` | $O(V^2)$ / $O(E \log V)$ |
+| **12** | Dijkstra | Shortest Path | `DA - Flight` | $O(V^2)$ / $O(E \log V)$ |
+| **13** | Multistage Graph | Dynamic Programming | `MSG - Logistics` | $O(V + E)$ |
+| **14** | Multistage Graph | Dynamic Programming | `MSG - Skyconnect` | $O(V + E)$ |
+| **15** | Multistage Graph | Dynamic Programming | `MSG - Emergency` | $O(V + E)$ |
+| **16** | 0/1 Knapsack | Dynamic Programming | `K - Disaster` | $O(n \cdot W)$ |
+| **17** | 0/1 Knapsack | Dynamic Programming | `K - Hospital` | $O(n \cdot W)$ |
+| **18** | 0/1 Knapsack | Dynamic Programming | `K - Cloud` | $O(n \cdot W)$ |
+| **19** | Graph Coloring | Backtracking | `GC - Classroom` | $O(V \cdot m^V)$ |
+| **20** | Graph Coloring | Backtracking | `GC - Interference` | $O(V \cdot m^V)$ |
+| **21** | Graph Coloring | Backtracking | `GC - University` | $O(V \cdot m^V)$ |
+| **22** | LC Branch & Bound | Branch & Bound | `LC - Delivery` | $O(n! \cdot n^2)$ |
+| **23** | LC Branch & Bound | Branch & Bound | `LC - Drilling` | $O(n! \cdot n^2)$ |
+| **24** | LC Branch & Bound | Branch & Bound | `LC - Flight` | $O(n! \cdot n^2)$ |
+
+---
+
+## ⚙️ Configuration
+
+View or update your default preferences:
+
+```powershell
+# Set custom destination folder
+dance config --set-dest "D:\My_DAA_Folder"
+
+# Reset configuration back to system defaults
+dance config --reset
+```
+
+---
+
+## 📄 License
+
+MIT © [AdityaxDeore](https://github.com/AdityaxDeore)

dancealgorithm-0.1.0/README.md

@@ -0,0 +1,174 @@
+# ⚡ DanceAlgorithm
+
+> **Instant DAA Problem Sheets, Datasets, Solutions & Algorithm Vault**  
+> Download, extract, organize, and directly **import** all 24 Design & Analysis of Algorithms (DAA) lab practical problem sheets, datasets, and Java solutions cleanly onto your PC with a single command or Python import.
+
+[![PyPI Version](https://img.shields.io/pypi/v/dancealgorithm.svg)](https://pypi.org/project/dancealgorithm/)
+[![Python Version](https://img.shields.io/badge/python-3.9%2B-blue.svg)](https://www.python.org/)
+[![License: MIT](https://img.shields.io/badge/License-MIT-yellow.svg)](https://opensource.org/licenses/MIT)
+[![Zero Dependencies](https://img.shields.io/badge/dependencies-0%20runtime-brightgreen.svg)]()
+
+---
+
+## 🌟 The Magic Experience
+
+### Option A: Install & Extract All 24 Problem Sheets to `C:\DAA_Assignments`
+
+```powershell
+pip install dancealgorithm; dance
+```
+
+Or run `dance` (or `dancealgorithm`) anytime in your terminal:
+
+```powershell
+dance
+```
+
+Your `C:\DAA_Assignments` folder is cleanly populated with all 24 problem sheets:
+
+```text
+C:\DAA_Assignments\
+├── MS - Customer/
+│   ├── dataset.csv
+│   └── Solution.java
+├── MS - Commerce/
+│   ├── dataset.csv
+│   └── Solution.java
+├── MS - Library/
+├── ...
+└── LC - Flight/
+    └── Solution.java
+```
+
+---
+
+## 🚀 Quick Terminal CLI Usage
+
+### 1. View Algorithm Notes & Time Complexities directly on screen
+
+No files extracted — instant terminal reference cheat sheets:
+
+```powershell
+# Merge Sort recurrence & analysis
+dance MS.txt
+
+# Quick Sort partition & analysis
+dance QS.txt
+
+# Dijkstra shortest path analysis
+dance DA.txt
+
+# Graph Coloring backtracking analysis
+dance GC.txt
+
+# Fractional Knapsack greedy proof
+dance FK.txt
+
+# 0/1 Knapsack dynamic programming
+dance K.txt
+
+# Multistage Graph backward DP
+dance MSG.txt
+
+# Least Cost Branch & Bound TSP
+dance LC.txt
+```
+
+*(You can also use `dancealgorithm DA.txt` or `dance DA`)*
+
+### 2. Extract a Specific Assignment Folder
+
+Extract only that particular folder:
+
+```powershell
+# Extract unquoted or quoted
+dance MSG - Logistics
+dance "DA - Smart"
+dance "GC - Classroom"
+dance "MS - Customer"
+
+# Or extract by problem number
+dance 1
+dance 13
+dance 19
+```
+
+### 3. List All Available Problem Sheets & Notes
+
+```powershell
+dance list
+```
+
+---
+
+## 🐍 Option B: Direct Python Import
+
+All 24 assignments can be directly inspected or extracted programmatically:
+
+```python
+import dancealgorithm
+
+# 1. Access code directly
+code = dancealgorithm.get("MSG - Logistics").code
+print(code)
+
+# 2. Extract a specific sheet
+dancealgorithm.extract("MSG - Logistics")
+
+# 3. Extract all sheets to custom destination
+dancealgorithm.extract(destination="D:/MyLabs")
+
+# 4. Open destination folder in Windows Explorer
+dancealgorithm.open_folder()
+```
+
+---
+
+## 📚 Complete Catalogue of All 24 DAA Problem Sheets
+
+| No. | Algorithm | Category | Problem Sheet Title | Time Complexity |
+|---|---|---|---|---|
+| **01** | Merge Sort | Divide & Conquer | `MS - Customer` | $O(n \log n)$ |
+| **02** | Merge Sort | Divide & Conquer | `MS - Commerce` | $O(n \log n)$ |
+| **03** | Merge Sort | Divide & Conquer | `MS - Library` | $O(n \log n)$ |
+| **04** | Quick Sort | Divide & Conquer | `QS - Movie` | $O(n \log n)$ avg |
+| **05** | Quick Sort | Divide & Conquer | `QS - Commerce` | $O(n \log n)$ avg |
+| **06** | Quick Sort | Divide & Conquer | `QS - Online` | $O(n \log n)$ avg |
+| **07** | Fractional Knapsack | Greedy Method | `FK - Emergency` | $O(n \log n)$ |
+| **08** | Fractional Knapsack | Greedy Method | `FK - Electric` | $O(n \log n)$ |
+| **09** | Fractional Knapsack | Greedy Method | `FK - Advertisement` | $O(n \log n)$ |
+| **10** | Dijkstra | Shortest Path | `DA - Smart` | $O(V^2)$ / $O(E \log V)$ |
+| **11** | Dijkstra | Shortest Path | `DA - Campus` | $O(V^2)$ / $O(E \log V)$ |
+| **12** | Dijkstra | Shortest Path | `DA - Flight` | $O(V^2)$ / $O(E \log V)$ |
+| **13** | Multistage Graph | Dynamic Programming | `MSG - Logistics` | $O(V + E)$ |
+| **14** | Multistage Graph | Dynamic Programming | `MSG - Skyconnect` | $O(V + E)$ |
+| **15** | Multistage Graph | Dynamic Programming | `MSG - Emergency` | $O(V + E)$ |
+| **16** | 0/1 Knapsack | Dynamic Programming | `K - Disaster` | $O(n \cdot W)$ |
+| **17** | 0/1 Knapsack | Dynamic Programming | `K - Hospital` | $O(n \cdot W)$ |
+| **18** | 0/1 Knapsack | Dynamic Programming | `K - Cloud` | $O(n \cdot W)$ |
+| **19** | Graph Coloring | Backtracking | `GC - Classroom` | $O(V \cdot m^V)$ |
+| **20** | Graph Coloring | Backtracking | `GC - Interference` | $O(V \cdot m^V)$ |
+| **21** | Graph Coloring | Backtracking | `GC - University` | $O(V \cdot m^V)$ |
+| **22** | LC Branch & Bound | Branch & Bound | `LC - Delivery` | $O(n! \cdot n^2)$ |
+| **23** | LC Branch & Bound | Branch & Bound | `LC - Drilling` | $O(n! \cdot n^2)$ |
+| **24** | LC Branch & Bound | Branch & Bound | `LC - Flight` | $O(n! \cdot n^2)$ |
+
+---
+
+## ⚙️ Configuration
+
+View or update your default preferences:
+
+```powershell
+# Set custom destination folder
+dance config --set-dest "D:\My_DAA_Folder"
+
+# Reset configuration back to system defaults
+dance config --reset
+```
+
+---
+
+## 📄 License
+
+MIT © [AdityaxDeore](https://github.com/AdityaxDeore)

dancealgorithm-0.1.0/pyproject.toml

@@ -0,0 +1,64 @@
+[build-system]
+requires = ["setuptools>=68.0.0", "wheel"]
+build-backend = "setuptools.build_meta"
+
+[project]
+name = "dancealgorithm"
+version = "0.1.0"
+description = "DanceAlgorithm: Instant DAA Algorithms, Lab Problem Sheets, Datasets, and Code Vault."
+readme = "README.md"
+requires-python = ">=3.9"
+license = "MIT"
+authors = [
+    { name = "DanceAlgorithm Maintainer" }
+]
+keywords = [
+    "dancealgorithm",
+    "daa",
+    "algorithms",
+    "problem-sheets",
+    "datasets",
+    "cli"
+]
+classifiers = [
+    "Development Status :: 4 - Beta",
+    "Environment :: Console",
+    "Intended Audience :: Education",
+    "Intended Audience :: Developers",
+    "Operating System :: OS Independent",
+    "Programming Language :: Python :: 3",
+    "Programming Language :: Python :: 3.9",
+    "Programming Language :: Python :: 3.10",
+    "Programming Language :: Python :: 3.11",
+    "Programming Language :: Python :: 3.12",
+    "Programming Language :: Python :: 3.13",
+    "Topic :: Education"
+]
+dependencies = []
+
+[project.scripts]
+dancealgorithm = "dancealgorithm.cli:main"
+dance = "dancealgorithm.cli:main"
+
+[project.urls]
+Homepage = "https://github.com/AdityaxDeore/dancealgorithm"
+
+[tool.setuptools.packages.find]
+where = ["src"]
+exclude = ["*.__pycache__*", "__pycache__"]
+
+[tool.setuptools.package-data]
+dancealgorithm = [
+    "assignments/**/*",
+]
+
+[tool.setuptools.exclude-package-data]
+dancealgorithm = [
+    "**/__pycache__/**",
+    "**/*.pyc",
+    "**/*.pyo",
+    "**/*.class"
+]
+
+
+

dancealgorithm-0.1.0/setup.cfg

@@ -0,0 +1,4 @@
+[egg_info]
+tag_build = 
+tag_date = 0
+

dancealgorithm-0.1.0/src/dancealgorithm/__init__.py

@@ -0,0 +1,128 @@
+"""
+DanceAlgorithm - Instant DAA Algorithms, Lab Problem Sheets, Datasets & Code Vault.
+All 24 Practical Exam Problem Sheets & Algorithm Notes Bundled & Instantly Importable.
+"""
+from __future__ import annotations
+
+import os
+import sys
+from pathlib import Path
+from typing import Any, Dict, List, Optional, Union
+
+__version__ = "0.1.0"
+
+# Import bundled assignments registry and sheets
+from dancealgorithm.assignments import ASSIGNMENTS_DIR, REGISTRY, SHEETS
+
+# Expose assignments mapping (e.g. dancealgorithm.assignments[1])
+assignments: Dict[Any, Any] = REGISTRY
+
+for sheet in SHEETS:
+    title = getattr(sheet, "TITLE", None)
+    if not title:
+        continue
+
+    sheet_aliases = {title}
+    # Sanitized alias
+    sheet_aliases.add(title.replace(" ", "_").replace("-", "_").replace("—", "_"))
+    sheet_aliases.add(title.replace(" ", "").replace("-", "").replace("—", ""))
+
+    for alias in sheet_aliases:
+        setattr(sys.modules[__name__], alias, sheet)
+        sys.modules[f"dancealgorithm.{alias}"] = sheet
+
+
+def get(identifier: Union[int, str]) -> Any:
+    """
+    Get a specific problem sheet module by number (1..24), ID (e.g. 'ps1', 'PS01'),
+    or keyword/name (e.g. 'Customer', 'MS - Customer', 'GC - Classroom').
+    """
+    if identifier in REGISTRY:
+        return REGISTRY[identifier]
+
+    if isinstance(identifier, int):
+        if identifier in REGISTRY:
+            return REGISTRY[identifier]
+
+    norm = str(identifier).strip().lower().replace("-", "").replace("_", "").replace(" ", "").replace("—", "")
+    digits = "".join(filter(str.isdigit, norm))
+    if digits:
+        val = int(digits)
+        if val in REGISTRY:
+            return REGISTRY[val]
+
+    # Keyword search across sheet titles
+    for sheet in SHEETS:
+        clean_title = sheet.TITLE.lower().replace("-", "").replace("_", "").replace(" ", "").replace("—", "")
+        if norm in clean_title or clean_title in norm:
+            return sheet
+
+    raise KeyError(f"Problem sheet not found for '{identifier}'. Available: 1..24.")
+
+
+# Convenience alias: dancealgorithm.ps(1)
+ps = get
+
+
+def list_assignments() -> List[Dict[str, Any]]:
+    """
+    List all available DAA practical assignments with titles and paths.
+    """
+    catalog = []
+    for sheet in SHEETS:
+        catalog.append({
+            "title": sheet.TITLE,
+            "path": sheet.PATH,
+            "has_solution": sheet.JAVA_SOLUTION.exists(),
+            "has_dataset": sheet.DATASET_PATH.exists(),
+        })
+    return catalog
+
+
+def extract(
+    sheet: Optional[Union[int, str]] = None,
+    destination: Optional[Union[str, Path]] = None,
+    overwrite: bool = True,
+) -> List[Path]:
+    """
+    Extract all problem sheets or a specific one to the destination directory.
+    Default destination is C:\\DAA_Assignments (or ~/DAA_Assignments).
+    """
+    from dancealgorithm.config import get_destination
+    from dancealgorithm.downloader import extract_bundled
+
+    target = Path(destination) if destination else get_destination()
+    sub_filt = str(sheet) if sheet is not None else None
+    return extract_bundled(target, subject_filter=sub_filt, overwrite=overwrite)
+
+
+def open_folder(destination: Optional[Union[str, Path]] = None) -> None:
+    """
+    Open the assignments destination folder in Windows File Explorer.
+    """
+    from dancealgorithm.config import get_destination
+    target = Path(destination) if destination else get_destination()
+    target.mkdir(parents=True, exist_ok=True)
+    if sys.platform == "win32":
+        os.system(f'explorer "{target}"')
+
+
+def __getattr__(name: str) -> Any:
+    try:
+        return get(name)
+    except KeyError:
+        raise AttributeError(f"module {__name__!r} has no attribute {name!r}")
+
+
+__all__ = [
+    "__version__",
+    "assignments",
+    "get",
+    "ps",
+    "list_assignments",
+    "extract",
+    "open_folder",
+]
+
+
+

dancealgorithm-0.1.0/src/dancealgorithm/__main__.py

@@ -0,0 +1,8 @@
+"""
+Entry point for python -m dancealgorithm.
+"""
+import sys
+from dancealgorithm.cli import main
+
+if __name__ == "__main__":
+    sys.exit(main())