dancealgorithm 0.1.0__tar.gz → 0.1.2__tar.gz

{dancealgorithm-0.1.0/src/dancealgorithm.egg-info → dancealgorithm-0.1.2}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: dancealgorithm
-Version: 0.1.0
+Version: 0.1.2
 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 24 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 24 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 24 problem sheets:
 
 ```text
 C:\DAA_Assignments\
@@ -59,9 +60,10 @@ C:\DAA_Assignments\
 ├── MS - Commerce/
 │   ├── dataset.csv
 │   └── Solution.java
-├── MS - Library/
 ├── ...
-└── LC - Flight/
+├── GC - University/
+│   └── Solution.java
+└── LC - Drilling/
     └── Solution.java
 ```
 
@@ -83,9 +85,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
 
@@ -95,11 +94,14 @@ dance K.txt
 # Multistage Graph backward DP
 dance MSG.txt
 
-# Least Cost Branch & Bound TSP
+# Graph Coloring backtracking analysis
+dance GC.txt
+
+# TSP - Least Cost Branch & Bound analysis
 dance LC.txt
 ```
 
-*(You can also use `dancealgorithm DA.txt` or `dance DA`)*
+*(You can also use `dancealgorithm DA.txt`, `dance GC.txt`, or `dance DA`)*
 
 ### 2. Extract a Specific Assignment Folder
 
@@ -110,12 +112,13 @@ Extract only that particular folder:
 dance MSG - Logistics
 dance "DA - Smart"
 dance "GC - Classroom"
-dance "MS - Customer"
+dance "LC - Delivery"
 
 # Or extract by problem number
 dance 1
 dance 13
 dance 19
+dance 24
 ```
 
 ### 3. List All Available Problem Sheets & Notes
@@ -143,7 +146,7 @@ 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()
 ```
 
@@ -171,12 +174,12 @@ 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)$ |
+| **19** | Graph Coloring | Backtracking | `GC - University` | $O(V \cdot m^V)$ |
+| **20** | Graph Coloring | Backtracking | `GC - Classroom` | $O(V \cdot m^V)$ |
+| **21** | Graph Coloring | Backtracking | `GC - Interference` | $O(V \cdot m^V)$ |
+| **22** | LC Branch and Bound | State Space Search | `LC - Delivery` | $O(n! \cdot n^2)$ |
+| **23** | LC Branch and Bound | State Space Search | `LC - Flight` | $O(n! \cdot n^2)$ |
+| **24** | LC Branch and Bound | State Space Search | `LC - Drilling` | $O(n! \cdot n^2)$ |
 
 ---
 

{dancealgorithm-0.1.0 → dancealgorithm-0.1.2}/README.md

@@ -1,10 +1,11 @@
 # ⚡ 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 24 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)]()
 
@@ -12,7 +13,7 @@
 
 ## 🌟 The Magic Experience
 
-### Option A: Install & Extract All 24 Problem Sheets to `C:\DAA_Assignments`
+### Option A: Install & Extract All 24 Problem Sheets
 
 ```powershell
 pip install dancealgorithm; dance
@@ -24,7 +25,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 24 problem sheets:
 
 ```text
 C:\DAA_Assignments\
@@ -34,9 +35,10 @@ C:\DAA_Assignments\
 ├── MS - Commerce/
 │   ├── dataset.csv
 │   └── Solution.java
-├── MS - Library/
 ├── ...
-└── LC - Flight/
+├── GC - University/
+│   └── Solution.java
+└── LC - Drilling/
     └── Solution.java
 ```
 
@@ -58,9 +60,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
 
@@ -70,11 +69,14 @@ dance K.txt
 # Multistage Graph backward DP
 dance MSG.txt
 
-# Least Cost Branch & Bound TSP
+# Graph Coloring backtracking analysis
+dance GC.txt
+
+# TSP - Least Cost Branch & Bound analysis
 dance LC.txt
 ```
 
-*(You can also use `dancealgorithm DA.txt` or `dance DA`)*
+*(You can also use `dancealgorithm DA.txt`, `dance GC.txt`, or `dance DA`)*
 
 ### 2. Extract a Specific Assignment Folder
 
@@ -85,12 +87,13 @@ Extract only that particular folder:
 dance MSG - Logistics
 dance "DA - Smart"
 dance "GC - Classroom"
-dance "MS - Customer"
+dance "LC - Delivery"
 
 # Or extract by problem number
 dance 1
 dance 13
 dance 19
+dance 24
 ```
 
 ### 3. List All Available Problem Sheets & Notes
@@ -118,7 +121,7 @@ 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()
 ```
 
@@ -146,12 +149,12 @@ 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)$ |
+| **19** | Graph Coloring | Backtracking | `GC - University` | $O(V \cdot m^V)$ |
+| **20** | Graph Coloring | Backtracking | `GC - Classroom` | $O(V \cdot m^V)$ |
+| **21** | Graph Coloring | Backtracking | `GC - Interference` | $O(V \cdot m^V)$ |
+| **22** | LC Branch and Bound | State Space Search | `LC - Delivery` | $O(n! \cdot n^2)$ |
+| **23** | LC Branch and Bound | State Space Search | `LC - Flight` | $O(n! \cdot n^2)$ |
+| **24** | LC Branch and Bound | State Space Search | `LC - Drilling` | $O(n! \cdot n^2)$ |
 
 ---
 

{dancealgorithm-0.1.0 → dancealgorithm-0.1.2}/pyproject.toml

@@ -4,7 +4,7 @@ build-backend = "setuptools.build_meta"
 
 [project]
 name = "dancealgorithm"
-version = "0.1.0"
+version = "0.1.2"
 description = "DanceAlgorithm: Instant DAA Algorithms, Lab Problem Sheets, Datasets, and Code Vault."
 readme = "README.md"
 requires-python = ">=3.9"
@@ -59,6 +59,8 @@ dancealgorithm = [
     "**/*.pyo",
     "**/*.class"
 ]
-
+
+
+
 
 

{dancealgorithm-0.1.0 → dancealgorithm-0.1.2}/src/dancealgorithm/__init__.py

@@ -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.2"
 
 # 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:
@@ -123,6 +128,4 @@ __all__ = [
     "extract",
     "open_folder",
 ]
-
-
-
+

{dancealgorithm-0.1.0 → dancealgorithm-0.1.2}/src/dancealgorithm/__main__.py

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

{dancealgorithm-0.1.0 → dancealgorithm-0.1.2}/src/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-0.1.0 → dancealgorithm-0.1.2}/src/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-0.1.0 → dancealgorithm-0.1.2}/src/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-0.1.0 → dancealgorithm-0.1.2}/src/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-0.1.0 → dancealgorithm-0.1.2}/src/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-0.1.0 → dancealgorithm-0.1.2}/src/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-0.1.2/src/dancealgorithm/assignments/GC - Classroom/Solution.java

@@ -0,0 +1,119 @@
+
+import java.util.*;
+
+public class Solution {
+    // 1. Main Function
+    public static void main(String args[]) {
+        Scanner sc = new Scanner(System.in);
+
+        System.out.print("Enter number of lectures: ");
+        int iSize = sc.nextInt();
+
+        String sLectures[] = new String[iSize];
+
+        // 2. Get Lecture Details
+        sc.nextLine();
+
+        for (int iCnt = 0; iCnt < iSize; iCnt++) {
+            System.out.print("Enter lecture " + (iCnt + 1) + ": ");
+            sLectures[iCnt] = sc.nextLine();
+        }
+
+        // 3. Create Conflict Graph
+        int iGraph[][] = new int[iSize][iSize];
+
+        System.out.print("Enter number of conflict pairs: ");
+        int iPairs = sc.nextInt();
+
+        for (int iCnt = 0; iCnt < iPairs; iCnt++) {
+            System.out.println("\nEnter lecture numbers for conflict pair " + (iCnt + 1));
+
+            System.out.print("First lecture: ");
+            int iU = sc.nextInt() - 1;
+
+            System.out.print("Second lecture: ");
+            int iV = sc.nextInt() - 1;
+
+            if (iU >= 0 && iU < iSize && iV >= 0 &&
+                    iV < iSize && iU != iV) {
+                iGraph[iU][iV] = 1;
+                iGraph[iV][iU] = 1;
+            } else {
+                System.out.println("Invalid lecture numbers!");
+                iCnt--;
+            }
+        }
+
+        // 4. Get Available Classrooms
+        System.out.print("\nEnter available classrooms: ");
+        int iRooms = sc.nextInt();
+
+        // 5. Apply Graph Coloring
+        ClassroomScheduler(iGraph, iRooms, sLectures);
+
+        sc.close();
+    }
+
+    // 6. Check Whether Color Is Safe
+    static boolean IsSafe(int iV, int iGraph[][],
+            int iColor[], int iC, int iSize) {
+        for (int iCnt = 0; iCnt < iSize; iCnt++) {
+            if (iGraph[iV][iCnt] == 1 && iColor[iCnt] == iC) {
+                return false;
+            }
+        }
+
+        return true;
+    }
+
+    // 7. Graph Coloring Using Backtracking
+    static boolean GraphColoring(int iGraph[][], int iRooms,
+            int iColor[], int iV, int iSize) {
+        if (iV == iSize) {
+            return true;
+        }
+
+        for (int iC = 1; iC <= iRooms; iC++) {
+            if (IsSafe(iV, iGraph, iColor, iC, iSize)) {
+                iColor[iV] = iC;
+
+                if (GraphColoring(iGraph, iRooms, iColor,
+                        iV + 1, iSize)) {
+                    return true;
+                }
+
+                // Backtrack
+                iColor[iV] = 0;
+            }
+        }
+
+        return false;
+    }
+
+    // 8. Classroom Scheduler
+    static void ClassroomScheduler(int iGraph[][],
+            int iRooms, String sLectures[]) {
+        int iSize = sLectures.length;
+        int iColor[] = new int[iSize];
+
+        System.out.println("\nClassroom Allocation:");
+        System.out.println("------------------------------------------------");
+
+        if (!GraphColoring(iGraph, iRooms, iColor, 0, iSize)) {
+            System.out.println("Cannot schedule all lectures without conflicts!");
+        } else {
+            System.out.printf("%-35s %-20s%n",
+                    "Lecture Session", "Allocated Classroom");
+
+            System.out.println("------------------------------------------------");
+
+            for (int iCnt = 0; iCnt < iSize; iCnt++) {
+                System.out.printf("%-35s Room Hall %d%n",
+                        sLectures[iCnt], iColor[iCnt]);
+            }
+
+            System.out.println("------------------------------------------------");
+            System.out.println("Status: All lectures scheduled without conflicts.");
+        }
+    }
+}

{dancealgorithm-0.1.0 → dancealgorithm-0.1.2}/src/dancealgorithm/assignments/GC - Classroom/__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-0.1.2/src/dancealgorithm/assignments/GC - Interference/Solution.java

@@ -0,0 +1,120 @@
+
+import java.util.*;
+
+public class Solution {
+    // 1. Main Function
+    public static void main(String args[]) {
+        Scanner sc = new Scanner(System.in);
+
+        System.out.print("Enter number of towers: ");
+        int iSize = sc.nextInt();
+
+        String sTowers[] = new String[iSize];
+
+        // 2. Get Tower Names
+        sc.nextLine();
+
+        for (int iCnt = 0; iCnt < iSize; iCnt++) {
+            System.out.print("Enter tower " + (iCnt + 1) + ": ");
+            sTowers[iCnt] = sc.nextLine();
+        }
+
+        // 3. Create Interference Graph
+        int iGraph[][] = new int[iSize][iSize];
+
+        System.out.print("Enter number of interference pairs: ");
+        int iPairs = sc.nextInt();
+
+        for (int iCnt = 0; iCnt < iPairs; iCnt++) {
+            System.out.println("\nEnter tower numbers for interference pair " + (iCnt + 1));
+
+            System.out.print("First tower: ");
+            int iU = sc.nextInt() - 1;
+
+            System.out.print("Second tower: ");
+            int iV = sc.nextInt() - 1;
+
+            if (iU >= 0 && iU < iSize && iV >= 0 &&
+                    iV < iSize && iU != iV) {
+                iGraph[iU][iV] = 1;
+                iGraph[iV][iU] = 1;
+            } else {
+                System.out.println("Invalid tower numbers!");
+                iCnt--;
+            }
+        }
+
+        // 4. Get Available Frequency Channels
+        System.out.print("\nEnter available frequency channels: ");
+        int iChannels = sc.nextInt();
+
+        // 5. Apply Graph Coloring
+        FrequencyAllocator(iGraph, iChannels, sTowers);
+
+        sc.close();
+    }
+
+    // 6. Check Whether Color Is Safe
+    static boolean IsSafe(int iV, int iGraph[][],
+            int iColor[], int iC, int iSize) {
+        for (int iCnt = 0; iCnt < iSize; iCnt++) {
+            if (iGraph[iV][iCnt] == 1 && iColor[iCnt] == iC) {
+                return false;
+            }
+        }
+
+        return true;
+    }
+
+    // 7. Graph Coloring Using Backtracking
+    static boolean GraphColoring(int iGraph[][], int iChannels,
+            int iColor[], int iV, int iSize) {
+        if (iV == iSize) {
+            return true;
+        }
+
+        for (int iC = 1; iC <= iChannels; iC++) {
+            if (IsSafe(iV, iGraph, iColor, iC, iSize)) {
+                iColor[iV] = iC;
+
+                if (GraphColoring(iGraph, iChannels, iColor,
+                        iV + 1, iSize)) {
+                    return true;
+                }
+
+                // Backtrack
+                iColor[iV] = 0;
+            }
+        }
+
+        return false;
+    }
+
+    // 8. Frequency Allocator
+    static void FrequencyAllocator(int iGraph[][],
+            int iChannels, String sTowers[]) {
+        int iSize = sTowers.length;
+        int iColor[] = new int[iSize];
+
+        System.out.println("\nCellular Network Frequency Allocation:");
+        System.out.println("---------------------------------------------------------------");
+
+        if (!GraphColoring(iGraph, iChannels, iColor, 0, iSize)) {
+            System.out.println("Cannot allocate frequencies without interference!");
+        } else {
+            System.out.printf("%-28s %-20s%n",
+                    "Cellular Tower", "Frequency Channel");
+
+            System.out.println("---------------------------------------------------------------");
+
+            for (int iCnt = 0; iCnt < iSize; iCnt++) {
+                System.out.printf("%-28s Channel %d (Band %d MHz)%n",
+                        sTowers[iCnt], iColor[iCnt],
+                        800 + iColor[iCnt] * 50);
+            }
+
+            System.out.println("---------------------------------------------------------------");
+            System.out.println("Status: All towers allocated without interference.");
+        }
+    }
+}

{dancealgorithm-0.1.0 → dancealgorithm-0.1.2}/src/dancealgorithm/assignments/GC - Interference/__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"):