dancealgorithm 0.1.0__py3-none-any.whl → 0.1.1__py3-none-any.whl

dancealgorithm/__init__.py

@@ -1,6 +1,6 @@
 """
 DanceAlgorithm - Instant DAA Algorithms, Lab Problem Sheets, Datasets & Code Vault.
-All 24 Practical Exam Problem Sheets & Algorithm Notes Bundled & Instantly Importable.
+All 18 Practical Exam Problem Sheets & Algorithm Notes Bundled & Instantly Importable.
 """
 from __future__ import annotations
 
@@ -9,7 +9,7 @@ import sys
 from pathlib import Path
 from typing import Any, Dict, List, Optional, Union
 
-__version__ = "0.1.0"
+__version__ = "0.1.1"
 
 # Import bundled assignments registry and sheets
 from dancealgorithm.assignments import ASSIGNMENTS_DIR, REGISTRY, SHEETS
@@ -34,8 +34,8 @@ for sheet in SHEETS:
 
 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').
+    Get a specific problem sheet module by number (1..18), ID (e.g. 'ps1', 'PS01'),
+    or keyword/name (e.g. 'Customer', 'MS - Customer', 'MSG - Logistics').
     """
     if identifier in REGISTRY:
         return REGISTRY[identifier]
@@ -57,7 +57,7 @@ def get(identifier: Union[int, str]) -> Any:
         if norm in clean_title or clean_title in norm:
             return sheet
 
-    raise KeyError(f"Problem sheet not found for '{identifier}'. Available: 1..24.")
+    raise KeyError(f"Problem sheet not found for '{identifier}'. Available: 1..18.")
 
 
 # Convenience alias: dancealgorithm.ps(1)
@@ -86,7 +86,7 @@ def extract(
 ) -> List[Path]:
     """
     Extract all problem sheets or a specific one to the destination directory.
-    Default destination is C:\\DAA_Assignments (or ~/DAA_Assignments).
+    Default destination is C:\\DAA_Assignments on Windows (or ~/DAA_Assignments on Linux).
     """
     from dancealgorithm.config import get_destination
     from dancealgorithm.downloader import extract_bundled
@@ -98,13 +98,18 @@ def extract(
 
 def open_folder(destination: Optional[Union[str, Path]] = None) -> None:
     """
-    Open the assignments destination folder in Windows File Explorer.
+    Open the assignments destination folder in the default system file manager.
+    Works seamlessly on Windows (explorer), macOS (open), and Linux (xdg-open).
     """
     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}"')
+    elif sys.platform == "darwin":
+        os.system(f'open "{target}"')
+    else:
+        os.system(f'xdg-open "{target}" 2>/dev/null &')
 
 
 def __getattr__(name: str) -> Any:
@@ -124,5 +129,3 @@ __all__ = [
     "open_folder",
 ]
 
-
-

dancealgorithm/__main__.py

@@ -6,3 +6,4 @@ from dancealgorithm.cli import main
 
 if __name__ == "__main__":
     sys.exit(main())
+

dancealgorithm/assignments/DA - Campus/__init__.py

@@ -25,6 +25,10 @@ def open_folder() -> None:
     import os
     if sys.platform == "win32":
         os.system(f'explorer "{PATH}"')
+    elif sys.platform == "darwin":
+        os.system(f'open "{PATH}"')
+    else:
+        os.system(f'xdg-open "{PATH}" 2>/dev/null &')
 
 def __getattr__(name: str):
     if name in ("code", "java_code", "solution_code"):

dancealgorithm/assignments/DA - Flight/__init__.py

@@ -25,6 +25,10 @@ def open_folder() -> None:
     import os
     if sys.platform == "win32":
         os.system(f'explorer "{PATH}"')
+    elif sys.platform == "darwin":
+        os.system(f'open "{PATH}"')
+    else:
+        os.system(f'xdg-open "{PATH}" 2>/dev/null &')
 
 def __getattr__(name: str):
     if name in ("code", "java_code", "solution_code"):

dancealgorithm/assignments/DA - Smart/__init__.py

@@ -25,6 +25,10 @@ def open_folder() -> None:
     import os
     if sys.platform == "win32":
         os.system(f'explorer "{PATH}"')
+    elif sys.platform == "darwin":
+        os.system(f'open "{PATH}"')
+    else:
+        os.system(f'xdg-open "{PATH}" 2>/dev/null &')
 
 def __getattr__(name: str):
     if name in ("code", "java_code", "solution_code"):

dancealgorithm/assignments/FK - Advertisement/__init__.py

@@ -25,6 +25,10 @@ def open_folder() -> None:
     import os
     if sys.platform == "win32":
         os.system(f'explorer "{PATH}"')
+    elif sys.platform == "darwin":
+        os.system(f'open "{PATH}"')
+    else:
+        os.system(f'xdg-open "{PATH}" 2>/dev/null &')
 
 def __getattr__(name: str):
     if name in ("code", "java_code", "solution_code"):

dancealgorithm/assignments/FK - Electric/__init__.py

@@ -25,6 +25,10 @@ def open_folder() -> None:
     import os
     if sys.platform == "win32":
         os.system(f'explorer "{PATH}"')
+    elif sys.platform == "darwin":
+        os.system(f'open "{PATH}"')
+    else:
+        os.system(f'xdg-open "{PATH}" 2>/dev/null &')
 
 def __getattr__(name: str):
     if name in ("code", "java_code", "solution_code"):

dancealgorithm/assignments/FK - Emergency/__init__.py

@@ -25,6 +25,10 @@ def open_folder() -> None:
     import os
     if sys.platform == "win32":
         os.system(f'explorer "{PATH}"')
+    elif sys.platform == "darwin":
+        os.system(f'open "{PATH}"')
+    else:
+        os.system(f'xdg-open "{PATH}" 2>/dev/null &')
 
 def __getattr__(name: str):
     if name in ("code", "java_code", "solution_code"):

dancealgorithm/assignments/K - Cloud/__init__.py

@@ -25,6 +25,10 @@ def open_folder() -> None:
     import os
     if sys.platform == "win32":
         os.system(f'explorer "{PATH}"')
+    elif sys.platform == "darwin":
+        os.system(f'open "{PATH}"')
+    else:
+        os.system(f'xdg-open "{PATH}" 2>/dev/null &')
 
 def __getattr__(name: str):
     if name in ("code", "java_code", "solution_code"):

dancealgorithm/assignments/K - Disaster/__init__.py

@@ -25,6 +25,10 @@ def open_folder() -> None:
     import os
     if sys.platform == "win32":
         os.system(f'explorer "{PATH}"')
+    elif sys.platform == "darwin":
+        os.system(f'open "{PATH}"')
+    else:
+        os.system(f'xdg-open "{PATH}" 2>/dev/null &')
 
 def __getattr__(name: str):
     if name in ("code", "java_code", "solution_code"):

dancealgorithm/assignments/K - Hospital/__init__.py

@@ -25,6 +25,10 @@ def open_folder() -> None:
     import os
     if sys.platform == "win32":
         os.system(f'explorer "{PATH}"')
+    elif sys.platform == "darwin":
+        os.system(f'open "{PATH}"')
+    else:
+        os.system(f'xdg-open "{PATH}" 2>/dev/null &')
 
 def __getattr__(name: str):
     if name in ("code", "java_code", "solution_code"):

dancealgorithm/assignments/MS - Commerce/__init__.py

@@ -25,6 +25,10 @@ def open_folder() -> None:
     import os
     if sys.platform == "win32":
         os.system(f'explorer "{PATH}"')
+    elif sys.platform == "darwin":
+        os.system(f'open "{PATH}"')
+    else:
+        os.system(f'xdg-open "{PATH}" 2>/dev/null &')
 
 def __getattr__(name: str):
     if name in ("code", "java_code", "solution_code"):

dancealgorithm/assignments/MS - Customer/__init__.py

@@ -25,6 +25,10 @@ def open_folder() -> None:
     import os
     if sys.platform == "win32":
         os.system(f'explorer "{PATH}"')
+    elif sys.platform == "darwin":
+        os.system(f'open "{PATH}"')
+    else:
+        os.system(f'xdg-open "{PATH}" 2>/dev/null &')
 
 def __getattr__(name: str):
     if name in ("code", "java_code", "solution_code"):

dancealgorithm/assignments/MS - Library/__init__.py

@@ -25,6 +25,10 @@ def open_folder() -> None:
     import os
     if sys.platform == "win32":
         os.system(f'explorer "{PATH}"')
+    elif sys.platform == "darwin":
+        os.system(f'open "{PATH}"')
+    else:
+        os.system(f'xdg-open "{PATH}" 2>/dev/null &')
 
 def __getattr__(name: str):
     if name in ("code", "java_code", "solution_code"):

dancealgorithm/assignments/MSG - Emergency/__init__.py

@@ -25,6 +25,10 @@ def open_folder() -> None:
     import os
     if sys.platform == "win32":
         os.system(f'explorer "{PATH}"')
+    elif sys.platform == "darwin":
+        os.system(f'open "{PATH}"')
+    else:
+        os.system(f'xdg-open "{PATH}" 2>/dev/null &')
 
 def __getattr__(name: str):
     if name in ("code", "java_code", "solution_code"):

dancealgorithm/assignments/MSG - Logistics/__init__.py

@@ -25,6 +25,10 @@ def open_folder() -> None:
     import os
     if sys.platform == "win32":
         os.system(f'explorer "{PATH}"')
+    elif sys.platform == "darwin":
+        os.system(f'open "{PATH}"')
+    else:
+        os.system(f'xdg-open "{PATH}" 2>/dev/null &')
 
 def __getattr__(name: str):
     if name in ("code", "java_code", "solution_code"):

dancealgorithm/assignments/MSG - Skyconnect/__init__.py

@@ -25,6 +25,10 @@ def open_folder() -> None:
     import os
     if sys.platform == "win32":
         os.system(f'explorer "{PATH}"')
+    elif sys.platform == "darwin":
+        os.system(f'open "{PATH}"')
+    else:
+        os.system(f'xdg-open "{PATH}" 2>/dev/null &')
 
 def __getattr__(name: str):
     if name in ("code", "java_code", "solution_code"):

dancealgorithm/assignments/QS - Commerce/__init__.py

@@ -25,6 +25,10 @@ def open_folder() -> None:
     import os
     if sys.platform == "win32":
         os.system(f'explorer "{PATH}"')
+    elif sys.platform == "darwin":
+        os.system(f'open "{PATH}"')
+    else:
+        os.system(f'xdg-open "{PATH}" 2>/dev/null &')
 
 def __getattr__(name: str):
     if name in ("code", "java_code", "solution_code"):

dancealgorithm/assignments/QS - Movie/__init__.py

@@ -25,6 +25,10 @@ def open_folder() -> None:
     import os
     if sys.platform == "win32":
         os.system(f'explorer "{PATH}"')
+    elif sys.platform == "darwin":
+        os.system(f'open "{PATH}"')
+    else:
+        os.system(f'xdg-open "{PATH}" 2>/dev/null &')
 
 def __getattr__(name: str):
     if name in ("code", "java_code", "solution_code"):

dancealgorithm/assignments/QS - Online/__init__.py

@@ -25,6 +25,10 @@ def open_folder() -> None:
     import os
     if sys.platform == "win32":
         os.system(f'explorer "{PATH}"')
+    elif sys.platform == "darwin":
+        os.system(f'open "{PATH}"')
+    else:
+        os.system(f'xdg-open "{PATH}" 2>/dev/null &')
 
 def __getattr__(name: str):
     if name in ("code", "java_code", "solution_code"):

dancealgorithm/assignments/__init__.py

@@ -1,6 +1,6 @@
 """
 DanceAlgorithm Bundled Problem Sheets & Assignments Vault.
-Contains all 24 DAA algorithms and problem sheets.
+Contains all 18 DAA algorithms and problem sheets from DAA_UPDATED_PIP.
 """
 from __future__ import annotations
 
@@ -15,30 +15,24 @@ SHEETS: List[Any] = []
 DAA_ASSIGNMENTS: Dict[str, Any] = {}
 
 ORDERED_NAMES = [
-    "MS - Customer",
-    "MS - Commerce",
-    "MS - Library",
-    "QS - Movie",
-    "QS - Commerce",
-    "QS - Online",
-    "FK - Emergency",
-    "FK - Electric",
-    "FK - Advertisement",
-    "DA - Smart",
-    "DA - Campus",
-    "DA - Flight",
-    "MSG - Logistics",
-    "MSG - Skyconnect",
-    "MSG - Emergency",
-    "K - Disaster",
-    "K - Hospital",
-    "K - Cloud",
-    "GC - Classroom",
-    "GC - Interference",
-    "GC - University",
-    "LC - Delivery",
-    "LC - Drilling",
-    "LC - Flight",
+    "MS - Customer",        # 1
+    "MS - Commerce",        # 2
+    "MS - Library",         # 3
+    "QS - Movie",           # 4
+    "QS - Commerce",        # 5
+    "QS - Online",          # 6
+    "FK - Emergency",       # 7
+    "FK - Electric",        # 8
+    "FK - Advertisement",   # 9
+    "DA - Smart",           # 10
+    "DA - Campus",          # 11
+    "DA - Flight",          # 12
+    "MSG - Logistics",      # 13
+    "MSG - Skyconnect",     # 14
+    "MSG - Emergency",      # 15
+    "K - Disaster",         # 16
+    "K - Hospital",         # 17
+    "K - Cloud",            # 18
 ]
 
 for idx, name in enumerate(ORDERED_NAMES, 1):

dancealgorithm/downloader.py

@@ -15,7 +15,7 @@ import zipfile
 from pathlib import Path
 from typing import Dict, List, Optional, Tuple
 
-USER_AGENT = "DanceAlgorithm-CLI/0.1.0"
+USER_AGENT = "DanceAlgorithm-CLI/0.1.1"
 MAX_ARCHIVE_SIZE_BYTES = 300 * 1024 * 1024  # 300 MB limit
 MAX_FILE_COUNT = 10000                      # 10,000 files limit
 
@@ -40,12 +40,6 @@ ORDERED_ASSIGNMENTS = [
     "K - Disaster",         # 16
     "K - Hospital",         # 17
     "K - Cloud",            # 18
-    "GC - Classroom",       # 19
-    "GC - Interference",    # 20
-    "GC - University",      # 21
-    "LC - Delivery",        # 22
-    "LC - Drilling",        # 23
-    "LC - Flight",          # 24
 ]
 
 

{dancealgorithm-0.1.0.dist-info → dancealgorithm-0.1.1.dist-info}/METADATA

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: dancealgorithm
-Version: 0.1.0
+Version: 0.1.1
 Summary: DanceAlgorithm: Instant DAA Algorithms, Lab Problem Sheets, Datasets, and Code Vault.
 Author: DanceAlgorithm Maintainer
 License-Expression: MIT
@@ -26,10 +26,11 @@ 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.
+> Download, extract, organize, and directly **import** all 18 Design & Analysis of Algorithms (DAA) lab practical problem sheets, datasets, and Java solutions cleanly onto your PC or Linux machine 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/)
+[![OS: Windows & Linux](https://img.shields.io/badge/OS-Windows%20%7C%20Linux%20%7C%20macOS-lightgrey.svg)]()
 [![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)]()
 
@@ -37,7 +38,7 @@ Dynamic: license-file
 
 ## 🌟 The Magic Experience
 
-### Option A: Install & Extract All 24 Problem Sheets to `C:\DAA_Assignments`
+### Option A: Install & Extract All 18 Problem Sheets
 
 ```powershell
 pip install dancealgorithm; dance
@@ -49,7 +50,7 @@ Or run `dance` (or `dancealgorithm`) anytime in your terminal:
 dance
 ```
 
-Your `C:\DAA_Assignments` folder is cleanly populated with all 24 problem sheets:
+Your `C:\DAA_Assignments` folder (or `~/DAA_Assignments` on Linux) is cleanly populated with all 18 problem sheets:
 
 ```text
 C:\DAA_Assignments\
@@ -61,7 +62,7 @@ C:\DAA_Assignments\
 │   └── Solution.java
 ├── MS - Library/
 ├── ...
-└── LC - Flight/
+└── K - Cloud/
     └── Solution.java
 ```
 
@@ -83,9 +84,6 @@ dance QS.txt
 # Dijkstra shortest path analysis
 dance DA.txt
 
-# Graph Coloring backtracking analysis
-dance GC.txt
-
 # Fractional Knapsack greedy proof
 dance FK.txt
 
@@ -94,9 +92,6 @@ 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`)*
@@ -109,13 +104,12 @@ Extract only that particular folder:
 # Extract unquoted or quoted
 dance MSG - Logistics
 dance "DA - Smart"
-dance "GC - Classroom"
 dance "MS - Customer"
 
 # Or extract by problem number
 dance 1
+dance 10
 dance 13
-dance 19
 ```
 
 ### 3. List All Available Problem Sheets & Notes
@@ -128,7 +122,7 @@ dance list
 
 ## 🐍 Option B: Direct Python Import
 
-All 24 assignments can be directly inspected or extracted programmatically:
+All 18 assignments can be directly inspected or extracted programmatically:
 
 ```python
 import dancealgorithm
@@ -143,13 +137,13 @@ dancealgorithm.extract("MSG - Logistics")
 # 3. Extract all sheets to custom destination
 dancealgorithm.extract(destination="D:/MyLabs")
 
-# 4. Open destination folder in Windows Explorer
+# 4. Open destination folder in system file manager (Windows, Linux, macOS)
 dancealgorithm.open_folder()
 ```
 
 ---
 
-## 📚 Complete Catalogue of All 24 DAA Problem Sheets
+## 📚 Complete Catalogue of All 18 DAA Problem Sheets
 
 | No. | Algorithm | Category | Problem Sheet Title | Time Complexity |
 |---|---|---|---|---|
@@ -171,12 +165,6 @@ dancealgorithm.open_folder()
 | **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)$ |
 
 ---
 

dancealgorithm-0.1.1.dist-info/RECORD

@@ -0,0 +1,60 @@
+dancealgorithm/__init__.py,sha256=JDRvQumu3ekC5qZ5gKNdUqkWc3k_xD1hDR7x8o7C-j8,4103
+dancealgorithm/__main__.py,sha256=o7NdtuZ8z0YCl_VHH-K-ScUaLzsEF-aJvBhEE83e_bA,147
+dancealgorithm/cli.py,sha256=c8iLHbPfxXj7nByjj6S07rPP87nJZHjcWKBITOBRkKY,11400
+dancealgorithm/config.py,sha256=DkKqK5KzWarrffRgOBXNMcP-6WO0plH7sWgRtJ_Clog,3469
+dancealgorithm/downloader.py,sha256=3mrtpw9xyVwH01UdsaL3-K2fbLOtH8ntQcKvjecSHoM,10662
+dancealgorithm/assignments/DA.txt,sha256=ApbF0CgOHjkxpu1U3mz9eKAFmms4YQTCIXSCI0tmGHY,821
+dancealgorithm/assignments/FK.txt,sha256=jkYwT6a9kHoLBGlqY49johxZ5nZ7hFvLB4rhO5Ta6Yc,677
+dancealgorithm/assignments/K.txt,sha256=z_qzBXO6X_6-X8giUxMyPiJMzPKQHvzsLCd43gZ6RQM,881
+dancealgorithm/assignments/MS.txt,sha256=quWqxFLWwj1gI36ZiOHdOrlO5Ld4Lf6M6Z5BaLq8m84,773
+dancealgorithm/assignments/MSG.txt,sha256=qAuQRPFpXe-mLN-RkPWRvLwFZg5hQfrxl68W5VQFzfs,785
+dancealgorithm/assignments/QS.txt,sha256=Oca81yUqcWjDqgqG2wuZdeOKIgzocllmqTpdpVpKltg,779
+dancealgorithm/assignments/__init__.py,sha256=_2CLWsvb_6i_S3xF4jTve5CEvMrfGc0h-dh4k89mGUM,1759
+dancealgorithm/assignments/DA - Campus/Solution.java,sha256=PKc8isqiJQgLrf5BcCIorPNC-QtYrEzTaVUupIFFhHs,5958
+dancealgorithm/assignments/DA - Campus/__init__.py,sha256=H1PkcrR0crEc_zXcIx7-13pSJ02U_9F8zm56qzNNlVY,1243
+dancealgorithm/assignments/DA - Flight/Solution.java,sha256=PqZW43eOeqCo6y6gBf42Rs--rNHAlVN7GypaCtvKz8w,6165
+dancealgorithm/assignments/DA - Flight/__init__.py,sha256=IDfBPry9ahTQb2VyB57zJm7qjqshcTYDsDtKG8npSwk,1243
+dancealgorithm/assignments/DA - Smart/Solution.java,sha256=rhYrq6UQMKKZ1BJ11agqgX2gSHJmS1_Gm3VDsKhDx4o,6602
+dancealgorithm/assignments/DA - Smart/__init__.py,sha256=O4yQmUOW-V8X-zzAyFZ3xo8YlywdDfQqAIZ2di4-qyE,1242
+dancealgorithm/assignments/FK - Advertisement/Solution.java,sha256=hWMEEfEEsOtVcZ6WGANoDatI9fCwTEsrUOX8CHxDWn4,4116
+dancealgorithm/assignments/FK - Advertisement/__init__.py,sha256=isFzxcgy_RO0MPrb-wXejaz7Wg1_aTUISxptWHfYEzA,1250
+dancealgorithm/assignments/FK - Electric/Solution.java,sha256=McdzpMtwOj7nogM2Dvs0D9VQjB9yNz-NfWpCHfRHJ3A,4919
+dancealgorithm/assignments/FK - Electric/__init__.py,sha256=ukfnlChm799GNbKwvOyvVH9XEBTIy8ZfoHbXmyb091E,1245
+dancealgorithm/assignments/FK - Emergency/Solution.java,sha256=VpDI36p3nvDmAgxCuAAouwe60U0m4GlPoWr1f3OLUJU,4376
+dancealgorithm/assignments/FK - Emergency/__init__.py,sha256=wW1nKieoGoEEqg_H4W6nunhzmJmJym8SMf0Dt0P43Lk,1246
+dancealgorithm/assignments/K - Cloud/Solution.java,sha256=YxfVvtj1z-oEnCJGLE9KW5piqOXXq-UyFY-Cw7rb4pQ,3651
+dancealgorithm/assignments/K - Cloud/__init__.py,sha256=9phRVy-jlOjNDVtFLztYcP2FwIiRaeiHFaPl2haNM44,1241
+dancealgorithm/assignments/K - Disaster/Solution.java,sha256=MEtGgOqiwP9oWPnDszLGudaytwasHmcKlUp3utMcPl4,3647
+dancealgorithm/assignments/K - Disaster/__init__.py,sha256=yMf72b6rZmC_KytRvo3lRT7blYagOS6Owi6COLTlGfA,1244
+dancealgorithm/assignments/K - Hospital/Solution.java,sha256=LrvcnmmErFjBs6y29e42JsIuu4JnZElFP3s-fTaAy7o,3737
+dancealgorithm/assignments/K - Hospital/__init__.py,sha256=zLAICmZYB3VbovKbQYNCfn-n59HcGeeLYneXpEu_NYA,1244
+dancealgorithm/assignments/MS - Commerce/Solution.java,sha256=KZlxjeT0Zw1I06SnfsEfM5GJ-HFs8j4y5Nuoe5YaMmw,4457
+dancealgorithm/assignments/MS - Commerce/__init__.py,sha256=zUTiYHn2ZC1xr5yvpgdYob5Fkj8_5pYbauC-56UZhkw,1245
+dancealgorithm/assignments/MS - Commerce/dataset.csv,sha256=zi5vDgC45LcQUMUumAJd1e7bUludJe6MtfI713BxCIY,720
+dancealgorithm/assignments/MS - Customer/Solution.java,sha256=K4e3VgAbxIPT1FIw4QHxi7kXKiGX7CXFdCu2gJKhefA,3762
+dancealgorithm/assignments/MS - Customer/__init__.py,sha256=aDT9IL0mwecc4rkXN063ENUsruZihwgohvY57ywz108,1245
+dancealgorithm/assignments/MS - Customer/dataset.csv,sha256=RTEtOyoQPfL1sqCMiKY9gUs0LJfCPCKRtUaDddYOcvU,725
+dancealgorithm/assignments/MS - Library/Solution.java,sha256=MlYVSxeMhB229rKGi_P2amtPpiTAKLrwnBEbn82jZnk,4214
+dancealgorithm/assignments/MS - Library/__init__.py,sha256=tctXnJemIWPjwbsnmVXHBYljYK1fQnMqYFUMDMDOlD4,1244
+dancealgorithm/assignments/MS - Library/dataset.csv,sha256=9qfxa3ipUxro7csXuEir0vnaOjeygrB4uhqYDgEI1sc,809
+dancealgorithm/assignments/MSG - Emergency/Solution.java,sha256=218ZsZD1Jt8aeSOL4CGuYHTzQopCB9k8sJRKHU3M8I8,6347
+dancealgorithm/assignments/MSG - Emergency/__init__.py,sha256=-9uuLeQU5ZFdt_G1E-bm6lAqFJ9wnicY2NkHRv1UjSY,1247
+dancealgorithm/assignments/MSG - Logistics/Solution.java,sha256=m-H-p4oA_tiB0xfKahqfeVPkyUCTpw0499_pl6rp3Og,5167
+dancealgorithm/assignments/MSG - Logistics/__init__.py,sha256=3BuggtH2pqBWewJ-sCQcQ7kdn5aKyF5LjQ44eSzVqf8,1247
+dancealgorithm/assignments/MSG - Skyconnect/Solution.java,sha256=uOToRaiothqxh8CwtRMbDcAkHSloSx3_TXa2FlvNLkQ,5983
+dancealgorithm/assignments/MSG - Skyconnect/__init__.py,sha256=TEEMMOF-umg37rElcxbuRgWmTkKHiQJMraRhY4jnZJY,1248
+dancealgorithm/assignments/QS - Commerce/Solution.java,sha256=K_IXP___lnrGwUuy8jL3EjhMp8XGJLElWsWDkj1VZpY,3898
+dancealgorithm/assignments/QS - Commerce/__init__.py,sha256=YSjbqg5t0udvBUIEvNK8HUWwDAN0jmTOrZfk4pAXhO0,1245
+dancealgorithm/assignments/QS - Commerce/dataset.csv,sha256=_BXt-P7o4DMGM1FZ6Kdm42BmfIj7LbhGZw9L-o5SSxk,634
+dancealgorithm/assignments/QS - Movie/Solution.java,sha256=jhekIeomEkmB6V23gLE00ZxWfHSFoqvyYlzDCiw2ll8,3848
+dancealgorithm/assignments/QS - Movie/__init__.py,sha256=9To6zv7CN5PmRK0Jz21kNQ88InNRvTVkkz4OvoxS9MQ,1242
+dancealgorithm/assignments/QS - Movie/dataset.csv,sha256=rsnfsXCCQWrRfNEB_lUdNWi6W8JKNNwUUZ3B2VFaRXw,480
+dancealgorithm/assignments/QS - Online/Solution.java,sha256=A8bALrw4QDgazRTUKpYZ1nBr1rVXezoFWjnvSQKHk_I,3747
+dancealgorithm/assignments/QS - Online/__init__.py,sha256=6HfCKL8PWcjMerKOJDq6qUglHp5XmvlF-x-YXpRaBfQ,1243
+dancealgorithm/assignments/QS - Online/dataset.csv,sha256=jLrUusfK5fqLRT9ZmJKZPDZ5s2Zw94JixGrKJGoGHNc,631
+dancealgorithm-0.1.1.dist-info/licenses/LICENSE,sha256=eE9Hj40DYTIwVR4OoOhSuK0sijGtFXOK9_atK1Lz6-A,1083
+dancealgorithm-0.1.1.dist-info/METADATA,sha256=smEC6kBtUKAfbyd2RAjHSAEAe0325BbXUrvCR1qbJo0,6004
+dancealgorithm-0.1.1.dist-info/WHEEL,sha256=mOdXR9C3wMVov7cSY8PY-XCzo3SmmWCHvGQr5csJoao,91
+dancealgorithm-0.1.1.dist-info/entry_points.txt,sha256=y31VtV8oOHRSQbU5bVTxqQndGGOyRCOaK_Cmd9bUcyI,91
+dancealgorithm-0.1.1.dist-info/top_level.txt,sha256=gst6Jq05KzE4EKbhCzRDSKtchmLdmeYDIqlqry342lM,15
+dancealgorithm-0.1.1.dist-info/RECORD,,

dancealgorithm/assignments/GC - Classroom/Solution.java

@@ -1,87 +0,0 @@
-import java.util.Arrays;
-
-// Main solution
-public class Solution {
-    // O(V * m^V)
-
-    // Safety check
-    public static boolean isSafe(int v, int[][] graph, int[] color, int c, int V) {
-        for (int i = 0; i < V; i++) {
-            if (graph[v][i] == 1 && color[i] == c) {
-                return false;
-            }
-        }
-        return true;
-    }
-
-    // Backtracking search
-    public static boolean graphColoringUtil(int[][] graph, int m, int[] color, int v, int V) {
-        if (v == V) {
-            return true;
-        }
-
-        for (int c = 1; c <= m; c++) {
-            if (isSafe(v, graph, color, c, V)) {
-                color[v] = c;
-
-                if (graphColoringUtil(graph, m, color, v + 1, V)) {
-                    return true;
-                }
-
-                // Backtrack
-                color[v] = 0;
-            }
-        }
-        return false;
-    }
-
-    public static void classroomScheduler(int[][] graph, int m, String[] lectures) {
-        int V = lectures.length;
-        int[] color = new int[V];
-        Arrays.fill(color, 0);
-
-        System.out.println("\nAcademic Classroom Allocation (Conflict-Free Scheduling):");
-        System.out.println("------------------------------------------------------------------");
-
-        if (!graphColoringUtil(graph, m, color, 0, V)) {
-            System.out.println("Cannot schedule all lectures with " + m + " classrooms without conflicts.");
-        } else {
-            System.out.printf("%-30s %-20s%n", "Lecture Session", "Allocated Classroom");
-            System.out.println("------------------------------------------------------------------");
-            for (int i = 0; i < V; i++) {
-                System.out.printf("%-30s Room Hall %d%n", lectures[i], color[i]);
-            }
-            System.out.println("------------------------------------------------------------------");
-            System.out.println("Status: All lectures scheduled with zero room booking collisions.");
-        }
-    }
-
-    // Driver code
-    public static void main(String[] args) {
-        System.out.println("=======================================================================");
-        System.out.println("PS 20: Classroom Scheduling Without Conflicts (Graph Coloring - Java)");
-        System.out.println("=======================================================================");
-
-        String[] lectures = {
-            "Physics 101 (9:00 - 10:00 AM)", // 0
-            "Chemistry 101 (9:30 - 10:30 AM)", // 1
-            "Math 201 (10:00 - 11:00 AM)", // 2
-            "Biology 101 (10:30 - 11:30 AM)", // 3
-            "English 102 (9:00 - 10:30 AM)", // 4
-            "History 101 (11:00 - 12:00 PM)" // 5
-        };
-        int V = lectures.length;
-
-        int[][] conflictGraph = {
-            {0, 1, 0, 0, 1, 0},
-            {1, 0, 1, 0, 1, 0},
-            {0, 1, 0, 1, 1, 0},
-            {0, 0, 1, 0, 0, 1},
-            {1, 1, 1, 0, 0, 0},
-            {0, 0, 0, 1, 0, 0}
-        };
-
-        int availableClassrooms = 3;
-        classroomScheduler(conflictGraph, availableClassrooms, lectures);
-    }
-}