dancealgorithm 0.1.0__py3-none-any.whl

dancealgorithm/assignments/MSG - Emergency/Solution.java

@@ -0,0 +1,211 @@
+
+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 = 8;
+        int iStages = 4;
+
+        String sNames[] = {
+                "NH-44 Crash Site",
+                "Primary Health Post PHC-1",
+                "Primary Health Post PHC-2",
+                "Community Health Post CHC-3",
+                "District Civil Hospital Alpha",
+                "District Civil Hospital Beta",
+                "Regional Medical Center",
+                "AIIMS Apex Trauma Care"
+        };
+
+        int iStage[] = { 0, 1, 1, 1, 2, 2, 2, 3 };
+
+        // 2. Create Multistage Graph
+        int iGraph[][] = new int[iSize][iSize];
+
+        for (int iCnt = 0; iCnt < iSize; iCnt++) {
+            Arrays.fill(iGraph[iCnt], INF);
+        }
+
+        // 3. Add Directed Roads and Travel Times
+
+        // Stage 1 to Stage 2
+        iGraph[0][1] = 15;
+        iGraph[0][2] = 12;
+        iGraph[0][3] = 18;
+
+        // Stage 2 to Stage 3
+        iGraph[1][4] = 25;
+        iGraph[1][5] = 30;
+
+        iGraph[2][4] = 20;
+        iGraph[2][5] = 22;
+        iGraph[2][6] = 28;
+
+        iGraph[3][5] = 24;
+        iGraph[3][6] = 26;
+
+        // Stage 3 to Stage 4
+        iGraph[4][7] = 35;
+        iGraph[5][7] = 28;
+        iGraph[6][7] = 32;
+
+        // 4. Display Available Locations
+        System.out.println("\nAvailable Medical Locations:");
+
+        for (int iCnt = 0; iCnt < iSize; iCnt++) {
+            System.out.println(iCnt + " : " + sNames[iCnt]);
+        }
+
+        // 5. Get Source and Destination
+        System.out.print("\nEnter Source Location: ");
+        String sSource = sc.nextLine();
+
+        System.out.print("Enter Destination Hospital: ");
+        String sDestination = sc.nextLine();
+
+        int iSource = findLocationIndex(sSource, sNames, iSize);
+        int iDestination = findLocationIndex(sDestination, sNames, iSize);
+
+        if (iSource == -1 || iDestination == -1) {
+            System.out.println("Invalid Location Name!");
+            sc.close();
+            return;
+        }
+
+        if (iStage[iSource] > iStage[iDestination]) {
+            System.out.println("No valid forward route available.");
+            sc.close();
+            return;
+        }
+
+        // 6. Apply Multistage Algorithm
+        Multistage(iGraph, iStage, iSize, iStages,
+                iSource, iDestination, sNames);
+
+        sc.close();
+    }
+
+    // 7. Multistage Dynamic Programming
+    static void Multistage(int iGraph[][], int iStage[],
+            int iSize, int iStages,
+            int iSource, int iDestination,
+            String sNames[]) {
+        int iTime[] = new int[iSize];
+        int iNext[] = new int[iSize];
+
+        Arrays.fill(iTime, INF);
+        Arrays.fill(iNext, -1);
+
+        iTime[iDestination] = 0;
+
+        // 8. Calculate Minimum Travel Time Backwards
+        for (int iCnt = iStage[iDestination] - 1; iCnt >= 0; iCnt--) {
+            for (int i = 0; i < iSize; i++) {
+                if (iStage[i] == iCnt) {
+                    for (int j = 0; j < iSize; j++) {
+                        if (iStage[j] > iStage[i] &&
+                                iStage[j] <= iStage[iDestination] &&
+                                iGraph[i][j] != INF &&
+                                iTime[j] != INF) {
+                            int iTotal = iGraph[i][j] + iTime[j];
+
+                            if (iTotal < iTime[i]) {
+                                iTime[i] = iTotal;
+                                iNext[i] = j;
+                            }
+                        }
+                    }
+                }
+            }
+        }
+
+        // 9. Display Optimal Evacuation Route
+        System.out.println("\nEmergency Patient Medical Evacuation:");
+        System.out.println("---------------------------------------------");
+
+        System.out.println("Source Location: " + sNames[iSource]);
+        System.out.println("Destination Hospital: " + sNames[iDestination]);
+
+        if (iTime[iSource] == INF) {
+            System.out.println("No valid evacuation route available.");
+        } else {
+            System.out.println("Minimum Travel Time: " +
+                    iTime[iSource] + " minutes");
+
+            System.out.print("Optimal Evacuation Route: ");
+
+            int iCurr = iSource;
+
+            while (iCurr != -1) {
+                System.out.print(sNames[iCurr]);
+
+                if (iCurr == iDestination) {
+                    break;
+                }
+
+                iCurr = iNext[iCurr];
+
+                if (iCurr != -1) {
+                    System.out.print(" -> ");
+                }
+            }
+        }
+
+        System.out.println("\n---------------------------------------------");
+    }
+
+    // Helper to resolve location by name, index, or "index : name"
+    static int findLocationIndex(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 = findLocationIndex(parts[0], sNames, iSize);
+            if (idx != -1) return idx;
+            idx = findLocationIndex(parts[1], sNames, iSize);
+            if (idx != -1) return idx;
+        }
+
+        if (sInput.contains("-")) {
+            String parts[] = sInput.split("-", 2);
+            int idx = findLocationIndex(parts[0], sNames, iSize);
+            if (idx != -1) return idx;
+            idx = findLocationIndex(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/MSG - Emergency/__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 = "MSG - Emergency"
+
+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/MSG - Logistics/Solution.java

@@ -0,0 +1,189 @@
+
+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 = 8;
+        int iStages = 4;
+
+        String sNames[] = {
+                "Surat",
+                "Mumbai",
+                "Pune",
+                "Nashik",
+                "Indore",
+                "Nagpur",
+                "Jaipur",
+                "Delhi"
+        };
+
+        // 2. Create Multistage Graph
+        int iGraph[][] = new int[iSize][iSize];
+
+        for (int iCnt = 0; iCnt < iSize; iCnt++) {
+            Arrays.fill(iGraph[iCnt], INF);
+        }
+
+        // 3. Add Directed Routes and Costs
+
+        // Stage 1 to Stage 2
+        iGraph[0][1] = 1;
+        iGraph[0][2] = 2;
+        iGraph[0][3] = 5;
+
+        // Stage 2 to Stage 3
+        iGraph[1][4] = 4;
+        iGraph[1][5] = 11;
+
+        iGraph[2][4] = 9;
+        iGraph[2][5] = 5;
+        iGraph[2][6] = 16;
+
+        iGraph[3][6] = 2;
+
+        // Stage 3 to Stage 4
+        iGraph[4][7] = 18;
+        iGraph[5][7] = 13;
+        iGraph[6][7] = 2;
+
+        // 4. Display Destination Cities
+        System.out.println("\nSwiftCargo Destination Cities:");
+
+        for (int iCnt = 1; iCnt < iSize; iCnt++) {
+            System.out.println(iCnt + " : " + sNames[iCnt]);
+        }
+
+        // 5. Get Destination City
+        System.out.print("\nEnter Destination City: ");
+        String sDestination = sc.nextLine();
+
+        int iDestination = findCityIndex(sDestination, sNames, iSize);
+
+        if (iDestination == -1) {
+            System.out.println("Invalid Destination City!");
+            sc.close();
+            return;
+        }
+
+        // 6. Apply Multistage Algorithm
+        Multistage(iGraph, iSize, iStages, iDestination, sNames);
+
+        sc.close();
+    }
+
+    // 7. Multistage Dynamic Programming
+    static void Multistage(int iGraph[][], int iSize,
+            int iStages, int iDestination,
+            String sNames[]) {
+        int iCost[] = new int[iSize];
+        int iNext[] = new int[iSize];
+
+        Arrays.fill(iCost, INF);
+        Arrays.fill(iNext, -1);
+
+        iCost[iDestination] = 0;
+
+        // 8. Calculate Minimum Cost Backwards
+        for (int iCnt = iStages - 1; iCnt >= 0; iCnt--) {
+            for (int i = 0; i < iSize; i++) {
+                for (int j = i + 1; j < iSize; j++) {
+                    if (iGraph[i][j] != INF && iCost[j] != INF) {
+                        int iTotal = iGraph[i][j] + iCost[j];
+
+                        if (iTotal < iCost[i]) {
+                            iCost[i] = iTotal;
+                            iNext[i] = j;
+                        }
+                    }
+                }
+            }
+        }
+
+        // 9. Display Optimal Delivery Route
+        System.out.println("\nSwiftCargo Logistics Route Optimization:");
+
+        System.out.println("Source City: Surat");
+        System.out.println("Destination City: " + sNames[iDestination]);
+
+        if (iCost[0] == INF) {
+            System.out.println("No valid route available.");
+        } else {
+            System.out.println("Minimum Total Cost: Rs. " + iCost[0]);
+
+            System.out.print("Optimal Delivery Route: ");
+
+            int iCurr = 0;
+
+            while (iCurr != -1) {
+                System.out.print(sNames[iCurr]);
+
+                if (iCurr == iDestination) {
+                    break;
+                }
+
+                iCurr = iNext[iCurr];
+
+                if (iCurr != -1) {
+                    System.out.print(" -> ");
+                }
+            }
+        }
+
+        System.out.println();
+    }
+
+    // Helper to resolve city by name, index, or "index : name"
+    static int findCityIndex(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 = findCityIndex(parts[0], sNames, iSize);
+            if (idx != -1) return idx;
+            idx = findCityIndex(parts[1], sNames, iSize);
+            if (idx != -1) return idx;
+        }
+
+        if (sInput.contains("-")) {
+            String parts[] = sInput.split("-", 2);
+            int idx = findCityIndex(parts[0], sNames, iSize);
+            if (idx != -1) return idx;
+            idx = findCityIndex(parts[1], sNames, iSize);
+            if (idx != -1) return idx;
+        }
+
+        try {
+            int idx = Integer.parseInt(sInput);
+            if (idx >= 1 && idx < iSize) {
+                return idx;
+            }
+        } catch (NumberFormatException ignored) {
+        }
+
+        for (int i = 1; i < iSize; i++) {
+            if (sNames[i].equalsIgnoreCase(sInput)) {
+                return i;
+            }
+        }
+
+        for (int i = 1; i < iSize; i++) {
+            if (sInput.toLowerCase().contains(sNames[i].toLowerCase()) ||
+                sNames[i].toLowerCase().contains(sInput.toLowerCase())) {
+                return i;
+            }
+        }
+
+        return -1;
+    }
+}

dancealgorithm/assignments/MSG - Logistics/__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 = "MSG - Logistics"
+
+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/MSG - Skyconnect/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 = 8;
+        int iStages = 4;
+
+        String sNames[] = {
+                "Chandigarh",
+                "Delhi",
+                "Lucknow",
+                "Ahmedabad",
+                "Mumbai",
+                "Pune",
+                "Hyderabad",
+                "Bengaluru"
+        };
+
+        int iStage[] = { 0, 1, 1, 1, 2, 2, 2, 3 };
+
+        // 2. Create Multistage Graph
+        int iGraph[][] = new int[iSize][iSize];
+
+        for (int iCnt = 0; iCnt < iSize; iCnt++) {
+            Arrays.fill(iGraph[iCnt], INF);
+        }
+
+        // 3. Add Directed Flights and Costs
+
+        // Stage 1 to Stage 2
+        iGraph[0][1] = 2200;
+        iGraph[0][2] = 2500;
+        iGraph[0][3] = 2800;
+
+        // Stage 2 to Stage 3
+        iGraph[1][4] = 4200;
+        iGraph[1][5] = 4500;
+
+        iGraph[2][4] = 3400;
+        iGraph[2][5] = 3600;
+        iGraph[2][6] = 3900;
+
+        iGraph[3][5] = 3200;
+        iGraph[3][6] = 3500;
+
+        // Stage 3 to Stage 4
+        iGraph[4][7] = 3100;
+        iGraph[5][7] = 2400;
+        iGraph[6][7] = 1900;
+
+        // 4. Display Available Airports
+        System.out.println("\nAvailable Airports:");
+
+        for (int iCnt = 0; iCnt < iSize; iCnt++) {
+            System.out.println(iCnt + " : " + sNames[iCnt]);
+        }
+
+        // 5. Get Source and Destination
+        System.out.print("\nEnter Source Airport: ");
+        String sSource = sc.nextLine();
+
+        System.out.print("Enter Destination 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 Name!");
+            sc.close();
+            return;
+        }
+
+        // 6. Apply Multistage Algorithm
+        Multistage(iGraph, iStage, iSize, iStages,
+                iSource, iDestination, sNames);
+
+        sc.close();
+    }
+
+    // 7. Multistage Dynamic Programming
+    static void Multistage(int iGraph[][], int iStage[],
+            int iSize, int iStages,
+            int iSource, int iDestination,
+            String sNames[]) {
+        int iCost[] = new int[iSize];
+        int iNext[] = new int[iSize];
+
+        Arrays.fill(iCost, INF);
+        Arrays.fill(iNext, -1);
+
+        iCost[iDestination] = 0;
+
+        // 8. Calculate Minimum Cost Backwards
+        for (int iCnt = iStage[iDestination] - 1; iCnt >= 0; iCnt--) {
+            for (int i = 0; i < iSize; i++) {
+                if (iStage[i] == iCnt) {
+                    for (int j = 0; j < iSize; j++) {
+                        if (iStage[j] > iStage[i] &&
+                                iStage[j] <= iStage[iDestination] &&
+                                iGraph[i][j] != INF &&
+                                iCost[j] != INF) {
+                            int iTotal = iGraph[i][j] + iCost[j];
+
+                            if (iTotal < iCost[i]) {
+                                iCost[i] = iTotal;
+                                iNext[i] = j;
+                            }
+                        }
+                    }
+                }
+            }
+        }
+
+        // 9. Display Optimal Flight Route
+        System.out.println("\nSkyConnect Flight Route Optimization:");
+        System.out.println("---------------------------------------------");
+
+        System.out.println("Source Airport: " + sNames[iSource]);
+        System.out.println("Destination Airport: " + sNames[iDestination]);
+
+        if (iCost[iSource] == INF) {
+            System.out.println("No valid flight route available.");
+        } else {
+            System.out.println("Minimum Ticket Cost: Rs. " + iCost[iSource]);
+
+            System.out.print("Optimal Flight Route: ");
+
+            int iCurr = iSource;
+
+            while (iCurr != -1) {
+                System.out.print(sNames[iCurr]);
+
+                if (iCurr == iDestination) {
+                    break;
+                }
+
+                iCurr = iNext[iCurr];
+
+                if (iCurr != -1) {
+                    System.out.print(" -> ");
+                }
+            }
+        }
+
+        System.out.println("\n---------------------------------------------");
+    }
+
+    // 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/MSG - Skyconnect/__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 = "MSG - Skyconnect"
+
+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}")