numpyUtilsUpdated 0.0.1__py3-none-any.whl

numpyUtilsUpdated/daa/SSSP_bellman_ford.py

@@ -0,0 +1,81 @@
+def bellman_ford(matrix, source):
+    vertices = len(matrix)
+    edges = [(i, j, matrix[i][j]) for i in range(vertices) for j in range(vertices) if matrix[i][j] != x and i != j]
+    dist = [x] * vertices
+    dist[source] = 0
+
+
+    for _ in range(vertices - 1):
+        for u, v, w in edges:
+            if dist[u] + w < dist[v]:
+                dist[v] = dist[u] + w
+
+
+    if any(dist[u] + w < dist[v] for u, v, w in edges):
+        print("Graph contains a negative weight cycle!")
+        return None
+
+
+    return dist
+
+
+x = float('inf')
+matrix = [
+    [0, -1, 4, x, x],
+    [x, 0, 3, 2, 2],
+    [x, x, 0, x, x],
+    [x, 1, 5, 0, x],
+    [x, x, x, -3, 0]
+]
+source = 0
+
+
+distances = bellman_ford(matrix, source)
+if distances:
+    print("Shortest distances from source:", distances)
+
+
+code = '''
+def bellman_ford(matrix, source):
+    vertices = len(matrix)
+    edges = [(i, j, matrix[i][j]) for i in range(vertices) for j in range(vertices) if matrix[i][j] != x and i != j]
+    dist = [x] * vertices
+    dist[source] = 0
+
+
+    for _ in range(vertices - 1):
+        for u, v, w in edges:
+            if dist[u] + w < dist[v]:
+                dist[v] = dist[u] + w
+
+
+    if any(dist[u] + w < dist[v] for u, v, w in edges):
+        print("Graph contains a negative weight cycle!")
+        return None
+
+
+    return dist
+
+
+x = float('inf')
+matrix = [
+    [0, -1, 4, x, x],
+    [x, 0, 3, 2, 2],
+    [x, x, 0, x, x],
+    [x, 1, 5, 0, x],
+    [x, x, x, -3, 0]
+]
+source = 0
+
+
+distances = bellman_ford(matrix, source)
+if distances:
+    print("Shortest distances from source:", distances)
+
+'''
+
+def getCode():
+    global code
+    print(code)
+
+    

numpyUtilsUpdated/daa/String_editing_problem.py

@@ -0,0 +1,75 @@
+def min_edit_distance(s1, s2, ic, dc, cc):
+    n1, n2 = len(s1), len(s2)
+    dp = [[0] * (n2 + 1) for _ in range(n1 + 1)]
+   
+    for i in range(n1 + 1):
+        dp[i][0] = i * dc
+    for j in range(n2 + 1):
+        dp[0][j] = j * ic  
+    for i in range(1, n1 + 1):
+        for j in range(1, n2 + 1):
+            cost = 0 if s1[i - 1] == s2[j - 1] else cc
+            dp[i][j] = min(
+                dp[i - 1][j] + dc,      
+                dp[i][j - 1] + ic,      
+                dp[i - 1][j - 1] + cost
+            )
+    print("The Cost Matrix is:")
+    for row in dp:
+        print(row)
+   
+    return dp[n1][n2]
+
+
+s1 = input("Enter First String: ")
+s2 = input("Enter Second String: ")
+ic = int(input("Enter Insertion Cost: "))
+dc = int(input("Enter Deletion Cost: "))
+cc = int(input("Enter Substitution Cost: "))
+
+
+cost = min_edit_distance(s1, s2, ic, dc, cc)
+print("The Total Cost is:", cost)
+
+
+code = '''
+def min_edit_distance(s1, s2, ic, dc, cc):
+    n1, n2 = len(s1), len(s2)
+    dp = [[0] * (n2 + 1) for _ in range(n1 + 1)]
+   
+    for i in range(n1 + 1):
+        dp[i][0] = i * dc
+    for j in range(n2 + 1):
+        dp[0][j] = j * ic  
+    for i in range(1, n1 + 1):
+        for j in range(1, n2 + 1):
+            cost = 0 if s1[i - 1] == s2[j - 1] else cc
+            dp[i][j] = min(
+                dp[i - 1][j] + dc,      
+                dp[i][j - 1] + ic,      
+                dp[i - 1][j - 1] + cost
+            )
+    print("The Cost Matrix is:")
+    for row in dp:
+        print(row)
+   
+    return dp[n1][n2]
+
+
+s1 = input("Enter First String: ")
+s2 = input("Enter Second String: ")
+ic = int(input("Enter Insertion Cost: "))
+dc = int(input("Enter Deletion Cost: "))
+cc = int(input("Enter Substitution Cost: "))
+
+
+cost = min_edit_distance(s1, s2, ic, dc, cc)
+print("The Total Cost is:", cost)
+
+'''
+
+def getCode():
+    global code
+    print(code)
+
+    

numpyUtilsUpdated/daa/TSP.py

@@ -0,0 +1,31 @@
+import sys
+
+# MAX = 10
+
+def tsp(n, dist, visited, current):
+    if visited == (1 << n) - 1:
+        return dist[current][0]
+    
+    min_cost = sys.maxsize 
+    for i in range(n):
+        if (visited & (1 << i)) == 0:  
+            cost = dist[current][i] + tsp(n, dist, visited | (1 << i), i)
+            min_cost = min(min_cost, cost)
+    
+    return min_cost
+
+def main():
+    n = int(input("Enter number of nodes: "))
+    dist = []
+    print("Enter the adjacency matrix:")
+    for i in range(n):
+        row = list(map(int, input().split()))
+        dist.append(row)
+    
+    visited = 1  # Starting at city 0
+    start_city = 0
+    min_cost = tsp(n, dist, visited, start_city)
+    print(f"Minimum cost: {min_cost}")
+
+if __name__ == "__main__":
+    main()

numpyUtilsUpdated/daa/__init__.py

@@ -0,0 +1,36 @@
+info = '''
+
+call getCode() method to print that code to Shell and it will also save the file ...
+
+1. APSP_floyd_warshall
+2. BinarySearch
+3. Dijkstras
+4. Greedy_01knapsack
+5. Greedy_01knapsack
+6. Job_Seq
+7. Kruskals
+8. Matrix
+9. min_max
+10. Prims
+11. Quick_Sort
+12. SSSP_bellman_ford
+13. String_editing_problem
+14. KnapDP
+15. TSP
+
+################ Example #################
+
+import numpyUtilsNani.daa
+# import daa
+import numpyUtilsNani.daa.getInfo
+
+import numpyUtilsNani.daa. APSP_floyd_warshall as prog1
+import numpyUtilsNani.daa.Greedy_01knapsack as prog2
+import numpyUtilsNani.daa.Greedy_FKanpsack as prog3 
+# ....
+ Method Usage
+prog1.getCode()
+
+'''
+
+print(info)

numpyUtilsUpdated/daa/min_max.py

@@ -0,0 +1,41 @@
+def max_min(arr, low, high):
+    if low == high:
+        return arr[low], arr[high]
+    elif low == high - 1:
+        if arr[low] > arr[high]:
+            return arr[low], arr[high]
+        else:
+            return arr[high], arr[low]
+    else:
+        mid = (low + high) // 2
+        max1, min1 = max_min(arr, low, mid)
+        max2, min2 = max_min(arr, mid + 1, high)
+        return max(max1, max2), min(min1, min2) 
+
+arr = list(map(int,input("Enter List elements: ").split()))
+max_v, min_v = max_min(arr, 0, len(arr) -1)
+print(f"Maximum: {max_v}  Minimum: {min_v}")
+
+code = '''
+def max_min(arr, low, high):
+    if low == high:
+        return arr[low], arr[high]
+    elif low == high - 1:
+        if arr[low] > arr[high]:
+            return arr[low], arr[high]
+        else:
+            return arr[high], arr[low]
+    else:
+        mid = (low + high) // 2
+        max1, min1 = max_min(arr, low, mid)
+        max2, min2 = max_min(arr, mid + 1, high)
+        return max(max1, max2), min(min1, min2) 
+
+arr = list(map(int,input("Enter List elements: ").split()))
+max_v, min_v = max_min(arr, 0, len(arr) -1)
+print(f"Maximum: {max_v}  Minimum: {min_v}")
+'''
+
+def getCode():
+    global code
+    print(code)

numpyutilsupdated-0.0.1.dist-info/METADATA

@@ -0,0 +1,103 @@
+Metadata-Version: 2.4
+Name: numpyUtilsUpdated
+Version: 0.0.1
+Summary: A collection of numpy utilities for data analysis and manipulation.
+Project-URL: Homepage, https://github.com/nani-here/numpyUtilsUpdated
+Project-URL: Issues, https://github.com/nani-here/numpyUtilsUpdated/issues
+Author-email: Nani bolthe! <neku.enduku2005@gmail.com>
+License-File: LICENSE
+Classifier: License :: OSI Approved :: GNU General Public License v3 (GPLv3)
+Classifier: Operating System :: OS Independent
+Classifier: Programming Language :: Python :: 3
+Requires-Python: >=3.0
+Description-Content-Type: text/markdown
+
+
+
+### 📦 `numpyUtilsUpdated` – *Naa Kodaka, Ee Package Thoppu!*
+
+*Arre, idhi* just any package *kaadhu, ra*. This is *THE* `numpyUtilsUpdated`, a *gunta*-sized bomb of AI algorithms, DAA *thummu*, and CS assignments. *Nuvvu* student *ayna, enthusiast ayina*, this is your *galli ka rockstar* for smashing those *bekaar* academic problems. *Choodu, ela kottan ra!*
+
+---
+
+## 📁 *Structure, Ra Mowa*
+
+```
+numpyUtilsUpdated/
+├── ai/      # AI algorithms, *picha lite* stuff
+├── cs/      # CS assignments, *sollu kaadhu*
+├── daa/     # DAA, *nee brain ni pindestham*
+└── __init__.py  # *Idhi start button, ra*
+```
+
+---
+
+## 📚 *Submodules, Ra – Chaduvu, Leda flower chekkestaa!*
+
+### 🔹 `daa` – *Design & Analysis of Algorithms, Ra Puli!*
+
+*Idhi* no *gundu* algorithms, *ra*. Full-on *gaddam* stuff:
+- Graphs: Dijkstra’s, Kruskal’s, Prim’s, Floyd-Warshall (*nee brain ni fry chestham*)
+- Knapsack (*greedy anta, DP anta, em peekuthav ra?*)
+- String editing, TSP, Job Sequencing, Quick Sort – *anni kottudu!*
+
+### 🔹 `ai` – *Artificial Intelligence, Ra Rey!*
+
+*Idhi* AI, *ra*, not your *sollu* chatbot. Check this *josh*:
+- Search: BFS, DFS, UCS, GBFS, Minimax, Alpha-Beta (*nee logic ni dimpudham*)
+- Problems: 8-puzzle, Tic-Tac-Toe, Water Jug, Wumpus World (*game over, ra!*)
+- Prolog logic, Graph Coloring – *nee brain ka debba debba ayipothadhi*
+
+### 🔹 `cs` – *CS Assignments, Ra, Settu!*
+
+*Semester assignments*? *Nenu unna, tension endhuku ra?*
+- File manipulation (*files ni jugglu chestham*)
+- Data structures (*stack, queue, ra?*)
+- Sorting, searching – *easy ga close chesey*
+
+---
+
+## 🚀 *Installation, Ra – Chinnadhi, Nee Size anta!*
+
+*Package ayithe*:
+```bash
+pip install numpyUtilsUpdated
+```
+*Ledha*, just clone or copy this *bad boy* into your folder. *Sarle, start chesey!*
+
+---
+
+## 🧠 *Usage, Ra – Ela Kottali?*
+
+```python
+import numpyUtilsUpdated as nani  # *Idhi naa peru, ra!*
+
+# DAA *thummu*
+nani.daa.Dijkstras.run_dijkstra(graph, source)  # *Path kottu ra!*
+
+# AI *josh*
+nani.ai.Minimax.play_game()  # *Game lo dimpu ra!*
+
+# CS *sollu*
+nani.cs.ass1.function_name()  # *Assignment close, ra!*
+```
+
+*Module import chesina ventane*, console lo *full list* of scripts *pop-up* avuthadhi. *Navigation*? *Picha easy, ra!*
+
+---
+
+## ✅ *Features, Ra – Naa Range Enti?*
+
+- *Modular AF*, *nuvvu confuse avvu kaadhu*
+- *Educational clarity* – *nuvvu chadivithe ardham avthadhi, ra!*
+- Covers all *classic* AI, DSA, CS *gunta* problems. *Nenu thopu, ra!*
+
+---
+
+## 👨‍💻 *Author, Ra – Nenu Evaru?*
+
+**Nani (Digipodhi!*)**  
+
+
+*Idhi* naa *khushi* tho, *learning* tho, and *sharing* tho build chesa. *Full ❤️, ra!* *Nuvvu try chey, naa package tho nee brain ni *pindesthaa*! 😜
+

numpyutilsupdated-0.0.1.dist-info/RECORD

@@ -0,0 +1,41 @@
+numpyUtilsUpdated/__init__.py,sha256=ZbwR7URsx-XxlP9hH5gA1oBG3CmBKuwGJEXCg7BgabU,257
+numpyUtilsUpdated/ai/AlphaBetaPr.py,sha256=M6qLtM-ddVPp_Czu1ZawMUz7qg8jxCtcFPVJxmEoKtE,1365
+numpyUtilsUpdated/ai/BFS_8pz.py,sha256=PyncUgZRVv3KlrtRMqoGvvSI84CIl_e1_19tY8oPc5I,1267
+numpyUtilsUpdated/ai/DFS_8pz.py,sha256=5rENzFj-kRWsM3-DxqQGDnaQhFP24g2CiZ0fECKgbhY,1679
+numpyUtilsUpdated/ai/DLimitS_8pz.py,sha256=oYIeVbHyLV90lUbDnAOe0OOfmG5Lsl-MN-AtFDcSuTM,1371
+numpyUtilsUpdated/ai/GBFS.py,sha256=qDcpa04kDcmk9ochK1E9O8A_4RltOhS4lbSbBVwNHkE,939
+numpyUtilsUpdated/ai/GraphColor.py,sha256=ykUqE9eNcr_fo5n6qrw5swe93qDBaR45oS9PNy05YUY,931
+numpyUtilsUpdated/ai/Minimax.py,sha256=X8mXlUuXJuQnOgcGEkXtURguF_mTqNKt8IKzS7MX0Yo,1836
+numpyUtilsUpdated/ai/Prologs.py,sha256=QNt2JogCcQbRQoOyy_-GOzBWWvANjBSuTcL4Zb7VGn4,801
+numpyUtilsUpdated/ai/UCS.py,sha256=urSC2MJJC6smh6jaJYOpQu16MpTWiqxM19a1mNAb0bM,1323
+numpyUtilsUpdated/ai/VaccumCleaner.py,sha256=QjQ1pnFSnxhmBg1INCetfNFLtqbzbmF2H9PzyteXkSM,1581
+numpyUtilsUpdated/ai/Wumpus.py,sha256=gGXZbdfxIX4nVWr6cmkMV9Wv2ULz2tqieXRW--y7M7c,2371
+numpyUtilsUpdated/ai/__init__.py,sha256=rvjZvJfOFqI6VRt2IWQHm4MKSmrjM-GZWbRcbh9XIuI,283
+numpyUtilsUpdated/ai/ticTacToe.py,sha256=-N6oSi7n0J4aEbuUkGVFJEhCpfRACVS6BVI0ZDtL1dg,2309
+numpyUtilsUpdated/ai/waterJug.py,sha256=60FpuZsVdqSYb7d3Us4mHknSGhQ6m_DBZFngYWKu6Lo,1326
+numpyUtilsUpdated/cs/__init__.py,sha256=LfZyBaz3-8qhhge3ezbVNNO6RN9dz0gWMZq4-znxZ1U,501
+numpyUtilsUpdated/cs/ass1.py,sha256=b6XbkuYqy20wb5LNbZZJJus8r523cv-wxOV2WP__a_k,1928
+numpyUtilsUpdated/cs/ass2.py,sha256=71ysZGrJ5cp8d5f1fGstV5gFGHnbD3Pdb7LmQgM_9ZE,1801
+numpyUtilsUpdated/cs/ass3.py,sha256=FOstUavKpQUKehE9y-EqwmtZQZ-1vz21bEY98ZCZIQ0,3507
+numpyUtilsUpdated/cs/ass4.py,sha256=saKK7mAZEwSnAsd_LhPDYrYMV8yk0H5cAqUzmZkYImk,2797
+numpyUtilsUpdated/daa/APSP_floyd_warshall.py,sha256=TxI5NCfWxIojKLeXxyOUlJCnVkZ-kIutMX_HkEoiB1k,1331
+numpyUtilsUpdated/daa/BinarySearch.py,sha256=IsnRw_KCX3HbXg55oGAsPWf9GpsGyjvtAmJLzAo9t2A,662
+numpyUtilsUpdated/daa/Dijkstras.py,sha256=RqGmGnGJ9tDrSCpv8vI3dkyzdFVre14RCqTtNm1jkfc,1989
+numpyUtilsUpdated/daa/Greedy_01knapsack.py,sha256=S9cAdcl9Knn0v0OKsCd3VThrCKXVVlRveeIr8HJZaz8,1353
+numpyUtilsUpdated/daa/Greedy_FKanpsack.py,sha256=cwgv2frK1ghnn0POHVDWkRYJ0bD-TwwSAQiZSAIJXv4,1527
+numpyUtilsUpdated/daa/Job_Seq.py,sha256=Q1HQREtbXVs1HdQK93asr2ITpdfbLYxJOKpqoZ4ZiAI,1993
+numpyUtilsUpdated/daa/KnapDP.py,sha256=9mfPt0t0vQGlh_OeeHPEUWMIhu249UOdNYySMRTwPC8,1038
+numpyUtilsUpdated/daa/Kruskals.py,sha256=6hGKxDz3yZ9RPHqdiBqqGLzHDV7wOhQmnyaniKy27Gc,2361
+numpyUtilsUpdated/daa/Matrix.py,sha256=mUv0CkyHzSa5E2UOLYQwvYeIZy68TIf_IkEzanUQxJA,3335
+numpyUtilsUpdated/daa/Prims.py,sha256=d1VDJ1bx22hB7dsVrDilosH2k2vYUl3phdUmRknPKzg,2147
+numpyUtilsUpdated/daa/Quick_Sort.py,sha256=ctrUW5aCJUnwnrtXKb_Cn9A5s3c9dvaGNuoAR35Sm7k,1617
+numpyUtilsUpdated/daa/SSSP_bellman_ford.py,sha256=vGVgOUQ2QuPgGgZ3n9QRmX380ELOmON74ctxwUm0Ons,1715
+numpyUtilsUpdated/daa/String_editing_problem.py,sha256=35ndYFJtuNzMNmfIXQV937zS0qa6dbT3fM9HSiuTENE,1945
+numpyUtilsUpdated/daa/TSP.py,sha256=aUcS6FFEt3anrUkcJwyHo6bFf5xUa_vEdPQ9B8D3HZ4,790
+numpyUtilsUpdated/daa/__init__.py,sha256=kXJITsSu_UGUZGuA97rbgWtgo6dJpAlTjanSiJxzdoE,699
+numpyUtilsUpdated/daa/getInfo.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
+numpyUtilsUpdated/daa/min_max.py,sha256=FKPxT0_THlmvkkuIUUusjEjXSVqJuYlkO3bINqLoZlA,1243
+numpyutilsupdated-0.0.1.dist-info/METADATA,sha256=GYDnjGOOn6zTIQcU3GMUwSP3AbFsBDQ1mG8XQMW0SgE,3361
+numpyutilsupdated-0.0.1.dist-info/WHEEL,sha256=qtCwoSJWgHk21S1Kb4ihdzI2rlJ1ZKaIurTj_ngOhyQ,87
+numpyutilsupdated-0.0.1.dist-info/licenses/LICENSE,sha256=gcuuhKKc5-dwvyvHsXjlC9oM6N5gZ6umYbC8ewW1Yvg,35821
+numpyutilsupdated-0.0.1.dist-info/RECORD,,

numpyutilsupdated-0.0.1.dist-info/WHEEL

@@ -0,0 +1,4 @@
+Wheel-Version: 1.0
+Generator: hatchling 1.27.0
+Root-Is-Purelib: true
+Tag: py3-none-any