dancealgorithm 0.1.0__py3-none-any.whl

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/__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())

dancealgorithm/assignments/DA - Campus/Solution.java

@@ -0,0 +1,198 @@
+
+import java.util.*;
+
+// 1. Main Function
+public class Solution {
+    static final int INF = 999999;
+
+    public static void main(String args[]) {
+        Scanner sc = new Scanner(System.in);
+
+        int iSize = 6;
+
+        String sNames[] = {
+                "PCCOE Main Server",
+                "PCCOE Computer Engineering",
+                "PCCOE IT Department",
+                "PCCOE Electronics Department",
+                "PCCOE Central Library",
+                "PCCOE Hostel"
+        };
+
+        // 2. Create Adjacency Matrix
+        int iGraph[][] = {
+                { 0, 4, 2, INF, INF, INF },
+                { 4, 0, 1, 5, INF, INF },
+                { 2, 1, 0, 8, 10, INF },
+                { INF, 5, 8, 0, 2, 6 },
+                { INF, INF, 10, 2, 0, 3 },
+                { INF, INF, INF, 6, 3, 0 }
+        };
+
+        // 3. Display Network Nodes
+        System.out.println("\nAvailable PCCOE Network Nodes:");
+
+        for (int iCnt = 0; iCnt < iSize; iCnt++) {
+            System.out.println(iCnt + " : " + sNames[iCnt]);
+        }
+
+        // 4. Get Source and Destination
+        System.out.print("\nEnter Source Node: ");
+        String sSource = sc.nextLine();
+
+        System.out.print("Enter Destination Node: ");
+        String sDestination = sc.nextLine();
+
+        int iSource = findNodeIndex(sSource, sNames, iSize);
+        int iDestination = findNodeIndex(sDestination, sNames, iSize);
+
+        if (iSource == -1 || iDestination == -1) {
+            System.out.println("Invalid Node!");
+            sc.close();
+            return;
+        }
+
+        // 5. Apply Dijkstra Algorithm
+        Dijkstra(iGraph, iSource, iDestination, iSize, sNames);
+
+        sc.close();
+    }
+
+    // 6. Find Minimum Latency Node
+    static int MinLatency(int dDist[], boolean bVisited[], int iSize) {
+        int iMin = INF;
+        int iMinIndex = -1;
+
+        for (int iCnt = 0; iCnt < iSize; iCnt++) {
+            if (!bVisited[iCnt] && dDist[iCnt] < iMin) {
+                iMin = dDist[iCnt];
+                iMinIndex = iCnt;
+            }
+        }
+
+        return iMinIndex;
+    }
+
+    // 7. Print Shortest Path
+    static void PrintPath(int iPrev[], int iTarget, String sNames[]) {
+        if (iPrev[iTarget] != -1) {
+            PrintPath(iPrev, iPrev[iTarget], sNames);
+            System.out.print(" -> ");
+        }
+
+        System.out.print(sNames[iTarget]);
+    }
+
+    // 8. Dijkstra Algorithm
+    static void Dijkstra(int iGraph[][], int iSource,
+            int iDestination, int iSize, String sNames[]) {
+        int dDist[] = new int[iSize];
+        boolean bVisited[] = new boolean[iSize];
+        int iPrev[] = new int[iSize];
+
+        Arrays.fill(dDist, INF);
+        Arrays.fill(iPrev, -1);
+
+        dDist[iSource] = 0;
+
+        for (int iCnt = 0; iCnt < iSize - 1; iCnt++) {
+            int iU = MinLatency(dDist, bVisited, iSize);
+
+            if (iU == -1) {
+                break;
+            }
+
+            bVisited[iU] = true;
+
+            for (int iV = 0; iV < iSize; iV++) {
+                if (!bVisited[iV] &&
+                        iGraph[iU][iV] != INF &&
+                        dDist[iU] + iGraph[iU][iV] < dDist[iV]) {
+                    dDist[iV] = dDist[iU] + iGraph[iU][iV];
+                    iPrev[iV] = iU;
+                }
+            }
+        }
+
+        // 9. Display Shortest Paths to All Nodes
+        System.out.println("\nMinimum Latency Routes:");
+
+        for (int iCnt = 0; iCnt < iSize; iCnt++) {
+            System.out.print("\n" + sNames[iCnt] + " : ");
+
+            if (dDist[iCnt] == INF) {
+                System.out.println("Unreachable");
+            } else {
+                System.out.print(dDist[iCnt] + " ms | Route: ");
+                PrintPath(iPrev, iCnt, sNames);
+                System.out.println();
+            }
+        }
+
+        // 10. Display Selected Destination
+        System.out.println("\n----------------------------------------");
+
+        if (dDist[iDestination] == INF) {
+            System.out.println("Destination is unreachable.");
+        } else {
+            System.out.println("Target Node: " + sNames[iDestination]);
+            System.out.println("Minimum Latency: " + dDist[iDestination] + " ms");
+
+            System.out.print("Shortest Network Path: ");
+            PrintPath(iPrev, iDestination, sNames);
+            System.out.println();
+        }
+
+        System.out.println("----------------------------------------");
+    }
+
+    // Helper to resolve node by name, index, or "index : name"
+    static int findNodeIndex(String sInput, String sNames[], int iSize) {
+        if (sInput == null) {
+            return -1;
+        }
+        sInput = sInput.trim();
+        if (sInput.isEmpty()) {
+            return -1;
+        }
+
+        if (sInput.contains(":")) {
+            String parts[] = sInput.split(":", 2);
+            int idx = findNodeIndex(parts[0], sNames, iSize);
+            if (idx != -1) return idx;
+            idx = findNodeIndex(parts[1], sNames, iSize);
+            if (idx != -1) return idx;
+        }
+
+        if (sInput.contains("-")) {
+            String parts[] = sInput.split("-", 2);
+            int idx = findNodeIndex(parts[0], sNames, iSize);
+            if (idx != -1) return idx;
+            idx = findNodeIndex(parts[1], sNames, iSize);
+            if (idx != -1) return idx;
+        }
+
+        try {
+            int idx = Integer.parseInt(sInput);
+            if (idx >= 0 && idx < iSize) {
+                return idx;
+            }
+        } catch (NumberFormatException ignored) {
+        }
+
+        for (int i = 0; i < iSize; i++) {
+            if (sNames[i].equalsIgnoreCase(sInput)) {
+                return i;
+            }
+        }
+
+        for (int i = 0; i < iSize; i++) {
+            if (sInput.toLowerCase().contains(sNames[i].toLowerCase()) ||
+                sNames[i].toLowerCase().contains(sInput.toLowerCase())) {
+                return i;
+            }
+        }
+
+        return -1;
+    }
+}

dancealgorithm/assignments/DA - Campus/__init__.py

@@ -0,0 +1,34 @@
+from __future__ import annotations
+import sys
+from pathlib import Path
+from typing import Optional
+
+PATH = Path(__file__).resolve().parent
+DIR = PATH
+JAVA_SOLUTION = PATH / "Solution.java"
+DATASET_PATH = PATH / "dataset.csv"
+TITLE = "DA - Campus"
+
+def get_code() -> str:
+    if JAVA_SOLUTION.exists():
+        return JAVA_SOLUTION.read_text(encoding="utf-8")
+    return ""
+
+def extract(destination: Optional[str | Path] = None, overwrite: bool = True) -> Path:
+    from dancealgorithm.downloader import extract_bundled
+    from dancealgorithm.config import get_destination
+    target = Path(destination) if destination else get_destination()
+    extract_bundled(target, subject_filter=TITLE, overwrite=overwrite)
+    return target / PATH.name
+
+def open_folder() -> None:
+    import os
+    if sys.platform == "win32":
+        os.system(f'explorer "{PATH}"')
+
+def __getattr__(name: str):
+    if name in ("code", "java_code", "solution_code"):
+        return get_code()
+    if name in ("path", "folder", "dir"):
+        return PATH
+    raise AttributeError(f"module {__name__!r} has no attribute {name!r}")

dancealgorithm/assignments/DA - Flight/Solution.java

@@ -0,0 +1,204 @@
+
+import java.util.*;
+
+// 1. Main Function
+public class Solution {
+    static final int INF = 999999;
+
+    public static void main(String args[]) {
+        Scanner sc = new Scanner(System.in);
+
+        int iSize = 6;
+
+        String sNames[] = {
+                "Delhi",
+                "Mumbai",
+                "Ahmedabad",
+                "Hyderabad",
+                "Bengaluru",
+                "Chennai"
+        };
+
+        // 2. Create Flight Adjacency Matrix
+        int iGraph[][] = {
+                { 0, 130, 95, INF, INF, INF },
+                { 130, 0, 75, 90, 105, INF },
+                { 95, 75, 0, 100, INF, INF },
+                { INF, 90, 100, 0, 75, 70 },
+                { INF, 105, INF, 75, 0, 55 },
+                { INF, INF, INF, 70, 55, 0 }
+        };
+
+        // 3. Display Available Airports
+        System.out.println("\nAvailable Airports:");
+
+        for (int iCnt = 0; iCnt < iSize; iCnt++) {
+            System.out.println(iCnt + " : " + sNames[iCnt]);
+        }
+
+        // 4. Get Source and Destination
+        System.out.print("\nEnter Departure Airport: ");
+        String sSource = sc.nextLine();
+
+        System.out.print("Enter Arrival Airport: ");
+        String sDestination = sc.nextLine();
+
+        int iSource = findAirportIndex(sSource, sNames, iSize);
+        int iDestination = findAirportIndex(sDestination, sNames, iSize);
+
+        if (iSource == -1 || iDestination == -1) {
+            System.out.println("Invalid Airport!");
+            sc.close();
+            return;
+        }
+
+        // 5. Apply Dijkstra Algorithm
+        Dijkstra(iGraph, iSource, iDestination, iSize, sNames);
+
+        sc.close();
+    }
+
+    // 6. Find Minimum Distance Vertex
+    static int MinDistance(int dDist[], boolean bVisited[], int iSize) {
+        int iMin = INF;
+        int iMinIndex = -1;
+
+        for (int iCnt = 0; iCnt < iSize; iCnt++) {
+            if (!bVisited[iCnt] && dDist[iCnt] < iMin) {
+                iMin = dDist[iCnt];
+                iMinIndex = iCnt;
+            }
+        }
+
+        return iMinIndex;
+    }
+
+    // 7. Print Shortest Flight Path
+    static void PrintPath(int iPrev[], int iTarget, String sNames[]) {
+        if (iPrev[iTarget] != -1) {
+            PrintPath(iPrev, iPrev[iTarget], sNames);
+            System.out.print(" -> ");
+        }
+
+        System.out.print(sNames[iTarget]);
+    }
+
+    // 8. Dijkstra Algorithm
+    static void Dijkstra(int iGraph[][], int iSource,
+            int iDestination, int iSize, String sNames[]) {
+        int dDist[] = new int[iSize];
+        boolean bVisited[] = new boolean[iSize];
+        int iPrev[] = new int[iSize];
+
+        Arrays.fill(dDist, INF);
+        Arrays.fill(iPrev, -1);
+
+        dDist[iSource] = 0;
+
+        for (int iCnt = 0; iCnt < iSize - 1; iCnt++) {
+            int iU = MinDistance(dDist, bVisited, iSize);
+
+            if (iU == -1) {
+                break;
+            }
+
+            bVisited[iU] = true;
+
+            for (int iV = 0; iV < iSize; iV++) {
+                if (!bVisited[iV] &&
+                        iGraph[iU][iV] != INF &&
+                        dDist[iU] + iGraph[iU][iV] < dDist[iV]) {
+                    dDist[iV] = dDist[iU] + iGraph[iU][iV];
+                    iPrev[iV] = iU;
+                }
+            }
+        }
+
+        // 9. Display Shortest Routes to All Airports
+        System.out.println("\nShortest Flight Routes:");
+
+        for (int iCnt = 0; iCnt < iSize; iCnt++) {
+            System.out.print("\n" + sNames[iCnt] + " : ");
+
+            if (dDist[iCnt] == INF) {
+                System.out.println("Unreachable");
+            } else {
+                System.out.print(dDist[iCnt] + " minutes | Route: ");
+                PrintPath(iPrev, iCnt, sNames);
+                System.out.println();
+            }
+        }
+
+        // 10. Display Selected Destination
+        System.out.println("\n----------------------------------------");
+
+        if (dDist[iDestination] == INF) {
+            System.out.println("Destination is unreachable.");
+        } else {
+            System.out.println("Departure: " + sNames[iSource]);
+            System.out.println("Arrival: " + sNames[iDestination]);
+
+            System.out.println("Minimum Travel Time: " +
+                    dDist[iDestination] + " minutes");
+
+            System.out.printf("Travel Time in Hours: %.2f hours%n",
+                    dDist[iDestination] / 60.0);
+
+            System.out.print("Shortest Flight Route: ");
+            PrintPath(iPrev, iDestination, sNames);
+            System.out.println();
+        }
+
+        System.out.println("----------------------------------------");
+    }
+
+    // Helper to resolve airport by name, index, or "index : name"
+    static int findAirportIndex(String sInput, String sNames[], int iSize) {
+        if (sInput == null) {
+            return -1;
+        }
+        sInput = sInput.trim();
+        if (sInput.isEmpty()) {
+            return -1;
+        }
+
+        if (sInput.contains(":")) {
+            String parts[] = sInput.split(":", 2);
+            int idx = findAirportIndex(parts[0], sNames, iSize);
+            if (idx != -1) return idx;
+            idx = findAirportIndex(parts[1], sNames, iSize);
+            if (idx != -1) return idx;
+        }
+
+        if (sInput.contains("-")) {
+            String parts[] = sInput.split("-", 2);
+            int idx = findAirportIndex(parts[0], sNames, iSize);
+            if (idx != -1) return idx;
+            idx = findAirportIndex(parts[1], sNames, iSize);
+            if (idx != -1) return idx;
+        }
+
+        try {
+            int idx = Integer.parseInt(sInput);
+            if (idx >= 0 && idx < iSize) {
+                return idx;
+            }
+        } catch (NumberFormatException ignored) {
+        }
+
+        for (int i = 0; i < iSize; i++) {
+            if (sNames[i].equalsIgnoreCase(sInput)) {
+                return i;
+            }
+        }
+
+        for (int i = 0; i < iSize; i++) {
+            if (sInput.toLowerCase().contains(sNames[i].toLowerCase()) ||
+                sNames[i].toLowerCase().contains(sInput.toLowerCase())) {
+                return i;
+            }
+        }
+
+        return -1;
+    }
+}

dancealgorithm/assignments/DA - Flight/__init__.py

@@ -0,0 +1,34 @@
+from __future__ import annotations
+import sys
+from pathlib import Path
+from typing import Optional
+
+PATH = Path(__file__).resolve().parent
+DIR = PATH
+JAVA_SOLUTION = PATH / "Solution.java"
+DATASET_PATH = PATH / "dataset.csv"
+TITLE = "DA - Flight"
+
+def get_code() -> str:
+    if JAVA_SOLUTION.exists():
+        return JAVA_SOLUTION.read_text(encoding="utf-8")
+    return ""
+
+def extract(destination: Optional[str | Path] = None, overwrite: bool = True) -> Path:
+    from dancealgorithm.downloader import extract_bundled
+    from dancealgorithm.config import get_destination
+    target = Path(destination) if destination else get_destination()
+    extract_bundled(target, subject_filter=TITLE, overwrite=overwrite)
+    return target / PATH.name
+
+def open_folder() -> None:
+    import os
+    if sys.platform == "win32":
+        os.system(f'explorer "{PATH}"')
+
+def __getattr__(name: str):
+    if name in ("code", "java_code", "solution_code"):
+        return get_code()
+    if name in ("path", "folder", "dir"):
+        return PATH
+    raise AttributeError(f"module {__name__!r} has no attribute {name!r}")