depd-v3 1.0.0 → 1.2.0

package/Loan_Repay_Dataset.csv

@@ -0,0 +1,201 @@
+Age,Income,LoanAmount,CreditScore,ExistingLoans,Result
+28,23278,438786,581,1,0
+27,108696,438323,389,4,0
+22,32280,164629,538,4,0
+56,46062,425400,729,1,0
+38,20851,447833,463,5,0
+38,40379,162886,644,0,0
+27,67052,494331,652,4,0
+23,115647,290870,849,0,1
+45,30328,339428,600,5,0
+44,95674,150814,371,0,1
+39,30458,498432,538,0,0
+50,103320,487314,673,1,1
+34,107841,189973,373,4,0
+55,115568,178351,467,3,0
+56,48785,408935,632,0,0
+23,61347,260325,574,0,0
+57,114098,214981,517,5,0
+50,38726,188873,442,1,0
+55,54438,441650,738,4,0
+35,38131,317138,805,0,0
+28,40033,378962,463,5,0
+25,70432,250078,779,4,1
+56,21504,406664,417,5,0
+38,104012,228349,414,2,1
+50,20425,428584,569,4,0
+53,33947,377837,605,5,0
+33,40032,246038,465,4,0
+54,20074,364019,631,3,1
+44,60306,175541,359,1,1
+26,31226,433730,797,0,0
+55,36483,117314,786,4,0
+54,99507,271846,516,4,0
+33,113447,213429,708,5,1
+49,87839,286708,423,1,1
+42,22757,358443,535,4,0
+25,112778,380879,360,1,0
+23,63309,87149,826,1,1
+52,48080,332713,435,5,0
+57,95525,297815,548,3,0
+33,32363,100819,741,2,1
+50,115561,78401,400,0,1
+42,34322,180367,496,1,0
+29,75296,146200,585,3,0
+25,78082,473636,400,0,0
+55,21934,98896,542,1,0
+51,48016,260260,360,1,0
+45,54760,461078,765,2,1
+56,106752,426652,798,1,1
+34,27665,353657,362,5,0
+24,96569,299974,814,4,1
+53,30500,496348,490,0,0
+36,72923,112855,552,4,0
+60,30745,269794,835,2,0
+34,107782,425490,621,1,1
+29,108039,388428,607,3,0
+25,21220,290273,402,0,0
+53,54760,119445,657,0,1
+44,57353,132704,748,4,1
+60,105717,327317,308,5,0
+40,106951,104309,437,2,1
+27,117310,340048,459,2,1
+34,114058,229768,508,5,0
+37,86244,306131,557,0,1
+48,56265,73114,303,2,1
+37,41178,438618,752,4,0
+56,21267,108654,377,5,0
+55,24722,487568,678,4,0
+48,36704,71930,615,2,0
+23,66898,160140,555,5,0
+56,73264,375405,458,1,0
+32,74040,62995,483,5,0
+47,107806,435381,554,2,0
+27,70140,70302,781,1,1
+50,65830,210007,533,1,0
+33,72227,222103,585,0,1
+38,66025,386321,821,3,0
+55,63404,64470,418,2,1
+37,25014,106834,744,2,0
+41,77199,367828,823,0,1
+57,44914,183547,345,5,0
+54,90575,410110,501,2,0
+42,101678,214582,427,5,0
+53,60538,399643,718,2,1
+39,92667,116735,496,3,0
+45,108777,442237,478,4,0
+46,91819,487112,300,2,0
+48,96019,368065,629,3,0
+34,87000,298085,473,5,0
+53,107012,381843,643,0,1
+36,108184,212749,530,1,1
+23,52092,299108,374,3,0
+57,45485,426620,693,3,0
+30,105990,410512,305,0,1
+35,43053,471585,830,3,1
+36,35906,289317,436,3,0
+56,98047,216355,753,4,1
+53,75933,485457,756,1,1
+51,78991,185891,553,5,0
+54,83517,378596,544,2,0
+39,50735,192456,643,2,1
+26,38136,129078,536,3,0
+34,28418,267510,717,2,0
+47,28161,158440,730,3,0
+58,111163,60240,689,3,0
+43,59139,445037,699,3,0
+55,99069,165625,799,1,1
+52,23804,253873,644,5,0
+46,114919,136530,778,1,1
+55,23534,256580,327,0,0
+29,80515,145278,351,2,1
+34,79598,221361,645,3,0
+47,53065,487733,383,3,1
+55,26826,233480,529,5,1
+23,118858,66268,553,1,1
+60,39973,175066,429,3,0
+57,48569,293811,562,2,0
+59,118032,426626,417,1,1
+27,95849,63462,619,4,0
+45,71990,424873,503,0,0
+36,33356,415529,608,5,0
+28,94177,460326,342,2,0
+44,29038,315269,649,0,0
+52,33833,277291,670,5,0
+50,112708,130211,745,1,1
+38,100728,473729,795,3,0
+58,55179,218980,551,0,1
+49,51963,443465,775,4,0
+45,64092,65047,806,2,1
+34,66507,468293,564,2,0
+59,111905,194844,310,4,0
+26,51635,427526,716,3,0
+36,110519,299609,802,3,1
+26,58566,166180,714,5,1
+58,68368,298124,843,2,1
+56,63357,234450,764,2,1
+35,35814,428160,497,2,0
+55,119901,411844,489,1,1
+51,56241,429891,837,4,0
+27,45443,205318,532,2,0
+21,112801,330040,429,2,0
+24,92529,203163,429,5,0
+52,33446,56430,591,3,0
+42,44164,76936,558,3,0
+25,72521,307816,375,4,0
+24,39887,128222,611,0,0
+28,93147,450788,726,4,0
+60,49581,456686,835,3,0
+49,58974,358556,739,2,1
+24,99905,438019,401,1,0
+37,106563,92565,460,1,1
+25,40517,51402,718,3,0
+51,58175,67112,537,2,1
+50,29329,410387,539,2,0
+58,106662,471478,502,3,0
+35,104886,128113,572,1,0
+31,60319,361974,595,3,0
+40,111715,261030,578,4,0
+49,30543,363543,340,3,0
+59,52816,63560,393,1,1
+57,96955,60876,575,4,1
+32,81669,322086,752,2,1
+58,77132,382810,803,0,1
+47,63687,218326,407,1,1
+52,57777,397384,710,4,1
+26,61224,182329,631,0,1
+46,87449,482499,301,5,0
+50,74165,78418,492,4,0
+52,101973,281756,352,1,1
+29,57752,279699,796,0,0
+59,51365,422130,462,2,0
+56,73476,98868,530,0,1
+28,104896,486282,457,3,0
+39,86698,419838,579,3,0
+51,51946,289487,448,3,0
+59,86616,441272,439,0,0
+47,64548,462990,819,2,1
+39,115164,206529,801,1,1
+51,65236,224294,686,3,1
+33,111422,175202,692,1,1
+47,25720,216816,784,5,0
+45,70604,397964,455,3,0
+29,85836,359424,639,0,0
+49,33069,325749,767,0,0
+47,105823,130929,376,3,0
+37,64375,376767,707,5,0
+42,108389,329771,689,2,1
+52,90912,68821,370,1,1
+39,49817,441520,392,3,0
+27,78153,137223,606,0,0
+24,58452,237938,683,3,0
+54,74008,346709,484,1,0
+60,70140,374906,546,3,0
+30,50433,291775,560,3,0
+21,80981,200801,461,0,1
+43,97014,206842,734,5,1
+40,46111,251690,794,0,0
+57,67049,351366,602,5,0
+46,55976,54245,350,4,0
+39,50162,368276,660,1,1
+60,52850,405343,440,5,0

package/astar.py

@@ -0,0 +1,93 @@
+def aStarAlgo(start_node, stop_node):
+    open_set = set(start_node)
+    closed_set = set()
+    g = {}          
+    parents = {}    
+    g[start_node] = 0
+
+    parents[start_node] = start_node
+
+    while len(open_set) > 0:
+        n = None
+
+        for v in open_set:
+            if n == None or g[v] + heuristic(v) < g[n] + heuristic(n):
+                n = v
+
+        if n == stop_node or Graph_nodes[n] == None:
+            pass
+        else:
+            for (m, weight) in get_neighbors(n):
+                if m not in open_set and m not in closed_set:
+                    open_set.add(m)
+                    parents[m] = n
+                    g[m] = g[n] + weight
+
+                else:
+                    if g[m] > g[n] + weight:
+                        g[m] = g[n] + weight
+
+                        parents[m] = n
+
+                        if m in closed_set:
+                            closed_set.remove(m)
+                            open_set.add(m)
+
+        if n == None:
+            print('Path does not exist!')
+            return None
+
+        if n == stop_node:
+            path = []
+
+            while parents[n] != n:
+                path.append(n)
+                n = parents[n]
+
+            path.append(start_node)
+            path.reverse()
+
+            print('Path found: {}'.format(path))
+            return path
+
+        open_set.remove(n)
+        closed_set.add(n)
+
+    print('Path does not exist!')
+    return None
+
+def get_neighbors(v):
+    if v in Graph_nodes:
+        return Graph_nodes[v]
+    else:
+        return None
+
+def heuristic(n):
+    H_dist = {
+        'A': 11,
+        'B': 6,
+        'C': 5,
+        'D': 7,
+        'E': 3,
+        'F': 6,
+        'G': 5,
+        'H': 3,
+        'I': 1,
+        'J': 0
+    }
+
+    return H_dist[n]
+
+Graph_nodes = {
+    'A': [('B', 6), ('F', 3)],
+    'B': [('A', 6), ('C', 3), ('D', 2)],
+    'C': [('B', 3), ('D', 1), ('E', 5)],
+    'D': [('B', 2), ('C', 1), ('E', 8)],
+    'E': [('C', 5), ('D', 8), ('I', 5), ('J', 5)],
+    'F': [('A', 3), ('G', 1), ('H', 7)],
+    'G': [('F', 1), ('I', 3)],
+    'H': [('F', 7), ('I', 2)],
+    'I': [('E', 5), ('G', 3), ('H', 2), ('J', 3)],
+}
+
+aStarAlgo('A', 'J')

package/bfs.py

@@ -0,0 +1,26 @@
+graph = {
+    'A': ['B', 'C'],
+    'B': ['D', 'E'],
+    'C': ['F'],
+    'D': [],
+    'E': ['F'],
+    'F': []
+}
+
+visited = []
+queue = []
+
+def bfs(graph, node):
+    visited.append(node)
+    queue.append(node)
+
+    while queue:
+        s = queue.pop(0)
+        print(s, end=" ")
+
+        for neighbour in graph[s]:
+            if neighbour not in visited:
+                visited.append(neighbour)
+                queue.append(neighbour)
+
+bfs(graph, 'A')

package/decisiontree.py

@@ -0,0 +1,22 @@
+from sklearn.model_selection import train_test_split
+from sklearn.tree import DecisionTreeClassifier
+from sklearn.metrics import accuracy_score
+
+import pandas as pd
+
+sample_dataframe_df = pd.read_csv('Loan_Repay_Dataset.csv')
+
+x = sample_dataframe_df.drop(['Result'], axis=1)
+y = sample_dataframe_df['Result']
+
+train_x, test_x, train_y, test_y = train_test_split(
+    x, y, test_size=0.2, random_state=100
+)
+
+estimated = DecisionTreeClassifier().fit(train_x, train_y)
+
+predict_y = estimated.predict(test_x)
+
+print(predict_y)
+
+print(accuracy_score(test_y, predict_y))

package/dfs.py

@@ -0,0 +1,20 @@
+graph = {
+    'A': ['B', 'C'],
+    'B': ['D', 'E'],
+    'C': ['F'],
+    'D': [],
+    'E': ['F'],
+    'F': []
+}
+
+visited = set()
+
+def dfs(node):
+    if node not in visited:
+        print(node, end=" ")
+        visited.add(node)
+
+        for neighbour in graph[node]:
+            dfs(neighbour)
+
+dfs('A')

package/knn.py

@@ -0,0 +1,28 @@
+#k nearest
+from sklearn.neighbors import KNeighborsClassifier
+from sklearn.model_selection import train_test_split
+import pandas as pd
+
+sample_dataframe_df = pd.read_csv('Iris.csv')
+
+sample_dataframe_df.head(5)
+sample_dataframe_df['Species'].value_counts()
+
+x = sample_dataframe_df.drop(['Id', 'Species'], axis=1)
+y = sample_dataframe_df['Species']
+
+x.head(5)
+y.head(5)
+
+train_x, test_x, train_y, test_y = train_test_split(
+    x,
+    y,
+    train_size=0.8,
+    random_state=80
+)
+
+knn = KNeighborsClassifier(n_neighbors=5)
+
+knn.fit(train_x, train_y)
+
+knn.score(test_x, test_y)

package/lab.ipynb

@@ -2,7 +2,7 @@
  "cells": [
   {
    "cell_type": "code",
-   "execution_count": 2,
+   "execution_count": null,
    "id": "56190fb8",
    "metadata": {},
    "outputs": [
@@ -349,6 +349,47 @@
     "knn.score(test_x, test_y)"
    ]
   },
+  {
+   "cell_type": "code",
+   "execution_count": 9,
+   "id": "9a277da3",
+   "metadata": {},
+   "outputs": [
+    {
+     "name": "stdout",
+     "output_type": "stream",
+     "text": [
+      "[0 0 1 0 0 1 1 1 0 0 0 1 0 1 1 0 1 0 0 0 1 1 0 0 0 0 1 1 1 1 0 0 1 1 1 1 1\n",
+      " 0 0 0]\n",
+      "0.75\n"
+     ]
+    }
+   ],
+   "source": [
+    "from sklearn.model_selection import train_test_split\n",
+    "from sklearn.tree import DecisionTreeClassifier\n",
+    "from sklearn.metrics import accuracy_score\n",
+    "\n",
+    "import pandas as pd\n",
+    "\n",
+    "sample_dataframe_df = pd.read_csv('Loan_Repay_Dataset.csv')\n",
+    "\n",
+    "x = sample_dataframe_df.drop(['Result'], axis=1)\n",
+    "y = sample_dataframe_df['Result']\n",
+    "\n",
+    "train_x, test_x, train_y, test_y = train_test_split(\n",
+    "    x, y, test_size=0.2, random_state=100\n",
+    ")\n",
+    "\n",
+    "estimated = DecisionTreeClassifier().fit(train_x, train_y)\n",
+    "\n",
+    "predict_y = estimated.predict(test_x)\n",
+    "\n",
+    "print(predict_y)\n",
+    "\n",
+    "print(accuracy_score(test_y, predict_y))"
+   ]
+  },
   {
    "cell_type": "code",
    "execution_count": null,
@@ -545,7 +586,7 @@
    "name": "python",
    "nbconvert_exporter": "python",
    "pygments_lexer": "ipython3",
-   "version": "3.14.5"
+   "version": "3.14.6"
   }
  },
  "nbformat": 4,

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "depd-v3",
-  "version": "1.0.0",
+  "version": "1.2.0",
   "description": "",
   "license": "ISC",
   "author": "",

package/pandas_lab.py

@@ -0,0 +1,26 @@
+import pandas as pd
+
+sample_dataframe_df = pd.read_csv('Iris.csv')
+
+type(sample_dataframe_df)
+
+sample_dataframe_df.head(5)
+
+list(sample_dataframe_df.columns)
+
+sample_dataframe_df.head(5).transpose()
+
+sample_dataframe_df.shape
+
+sample_dataframe_df[0:10]
+
+sample_dataframe_df[-5:]
+
+sample_dataframe_df['SepalLengthCm']
+
+sample_dataframe_df.SepalLengthCm.value_count
+
+sample_dataframe_df[sample_dataframe_df['PetalLengthCm']>6]
+
+sample_dataframe_df.drop('Si.no', inplace=True, axis=1)
+list(sample_dataframe_df.columns)

package/waterjug.py

@@ -0,0 +1,26 @@
+#water jug bfs - use pop() for dfs
+from collections import deque
+
+def bfs(a, b, target):
+    q = deque([(0, 0)])
+    visited = set()
+
+    while q:
+        x, y = q.popleft()
+        if (x, y) in visited:
+            continue
+
+        visited.add((x, y))
+        print(x, y)
+
+        if x == target or y == target:
+            print("target reached")
+            break
+
+        q.extend([
+            (a, y), (x, b), (0, y), (x, 0),
+            (x - min(x, b - y), y + min(x, b - y)),
+            (x + min(y, a - x), y - min(y, a - x))
+        ])
+
+bfs(4, 3, 2)