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

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/__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/GC - Classroom/Solution.java

@@ -1,87 +1,119 @@
-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);
-    }
-}
+
+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/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/assignments/GC - Interference/Solution.java

@@ -1,88 +1,120 @@
-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;
-    }
-
-    // Solver entry
-    public static void frequencyAllocator(int[][] graph, int m, String[] towers) {
-        int V = towers.length;
-        int[] color = new int[V];
-        Arrays.fill(color, 0);
-
-        System.out.println("\nCellular Network Interference-Free Frequency Band Allocation:");
-        System.out.println("------------------------------------------------------------------");
-
-        if (!graphColoringUtil(graph, m, color, 0, V)) {
-            System.out.println("Cannot allocate frequencies without RF interference using " + m + " channels.");
-        } else {
-            System.out.printf("%-26s %-22s%n", "Cellular Tower", "Assigned Frequency Channel");
-            System.out.println("------------------------------------------------------------------");
-            for (int i = 0; i < V; i++) {
-                System.out.printf("%-26s Channel %d (Band %d MHz)%n", towers[i], color[i], 800 + color[i] * 50);
-            }
-            System.out.println("------------------------------------------------------------------");
-            System.out.println("Status: Zero co-channel interference across neighboring base stations.");
-        }
-    }
-
-    // Driver code
-    public static void main(String[] args) {
-        System.out.println("=======================================================================");
-        System.out.println("PS 21: Mobile Tower Frequency Allocation (Graph Coloring - Java)");
-        System.out.println("=======================================================================");
-
-        String[] towers = {
-            "Tower 1 (Marine Drive)", // 0
-            "Tower 2 (Bandra West)", // 1
-            "Tower 3 (Andheri East)", // 2
-            "Tower 4 (Kurla Junction)", // 3
-            "Tower 5 (Powai Hiranandani)", // 4
-            "Tower 6 (CSMI Airport Terminal)" // 5
-        };
-        int V = towers.length;
-
-        int[][] interferenceGraph = {
-            {0, 1, 1, 0, 0, 0},
-            {1, 0, 1, 1, 0, 0},
-            {1, 1, 0, 1, 1, 0},
-            {0, 1, 1, 0, 1, 1},
-            {0, 0, 1, 1, 0, 1},
-            {0, 0, 0, 1, 1, 0}
-        };
-
-        int availableChannels = 3;
-        frequencyAllocator(interferenceGraph, availableChannels, towers);
-    }
-}
+
+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/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"):