test-graph2 0.1.0__tar.gz

test_graph2-0.1.0/PKG-INFO

@@ -0,0 +1,27 @@
+Metadata-Version: 2.4
+Name: test-graph2
+Version: 0.1.0
+Summary: AI and ML practical codes
+Author: Aquif Shaikh
+Requires-Python: >=3.8
+Description-Content-Type: text/markdown
+Requires-Dist: scikit-learn
+Requires-Dist: matplotlib
+Requires-Dist: numpy
+
+# test-graph2
+
+AI & Machine Learning practical codes:
+- `PR01(BFS).py`
+- `PR01(IDFS).py`
+- `PR02(A star).py`
+- `PR05(Adaboost).py`
+- `PR07(KNN).py`
+- `PR08(SVM).py`
+
+## Usage
+
+```bash
+pip install test-graph2
+get-practicals
+```

test_graph2-0.1.0/README.md

@@ -0,0 +1,16 @@
+# test-graph2
+
+AI & Machine Learning practical codes:
+- `PR01(BFS).py`
+- `PR01(IDFS).py`
+- `PR02(A star).py`
+- `PR05(Adaboost).py`
+- `PR07(KNN).py`
+- `PR08(SVM).py`
+
+## Usage
+
+```bash
+pip install test-graph2
+get-practicals
+```

test_graph2-0.1.0/pyproject.toml

@@ -0,0 +1,28 @@
+[build-system]
+requires = ["setuptools>=61.0"]
+build-backend = "setuptools.build_meta"
+
+[project]
+name = "test-graph2"
+version = "0.1.0"
+authors = [
+  { name="Aquif Shaikh" },
+]
+description = "AI and ML practical codes"
+readme = "README.md"
+requires-python = ">=3.8"
+dependencies = [
+    "scikit-learn",
+    "matplotlib",
+    "numpy",
+]
+
+[project.scripts]
+get-practicals = "test_mod.cli:main"
+
+[tool.setuptools.packages.find]
+where = ["."]
+include = ["test_mod*"]
+
+[tool.setuptools.package-data]
+"test_mod" = ["files/*.py"]

test_graph2-0.1.0/setup.cfg

@@ -0,0 +1,4 @@
+[egg_info]
+tag_build = 
+tag_date = 0
+

test_graph2-0.1.0/setup.py

@@ -0,0 +1,23 @@
+from setuptools import setup, find_packages
+
+setup(
+    name="test-graph2",
+    version="0.1.0",
+    author="Aquif Shaikh",
+    description="AI and ML practical codes",
+    packages=find_packages(),
+    package_data={
+        "test_mod": ["files/*.py"],
+    },
+    include_package_data=True,
+    entry_points={
+        "console_scripts": [
+            "get-practicals=test_mod.cli:main",
+        ],
+    },
+    install_requires=[
+        "scikit-learn",
+        "matplotlib",
+        "numpy",
+    ],
+)

test_graph2-0.1.0/test_graph2.egg-info/PKG-INFO

@@ -0,0 +1,27 @@
+Metadata-Version: 2.4
+Name: test-graph2
+Version: 0.1.0
+Summary: AI and ML practical codes
+Author: Aquif Shaikh
+Requires-Python: >=3.8
+Description-Content-Type: text/markdown
+Requires-Dist: scikit-learn
+Requires-Dist: matplotlib
+Requires-Dist: numpy
+
+# test-graph2
+
+AI & Machine Learning practical codes:
+- `PR01(BFS).py`
+- `PR01(IDFS).py`
+- `PR02(A star).py`
+- `PR05(Adaboost).py`
+- `PR07(KNN).py`
+- `PR08(SVM).py`
+
+## Usage
+
+```bash
+pip install test-graph2
+get-practicals
+```

test_graph2-0.1.0/test_graph2.egg-info/SOURCES.txt

@@ -0,0 +1,18 @@
+README.md
+pyproject.toml
+setup.py
+test_graph2.egg-info/PKG-INFO
+test_graph2.egg-info/SOURCES.txt
+test_graph2.egg-info/dependency_links.txt
+test_graph2.egg-info/entry_points.txt
+test_graph2.egg-info/requires.txt
+test_graph2.egg-info/top_level.txt
+test_mod/__init__.py
+test_mod/__main__.py
+test_mod/cli.py
+test_mod/files/PR01(BFS).py
+test_mod/files/PR01(IDFS).py
+test_mod/files/PR02(A star).py
+test_mod/files/PR05(Adaboost).py
+test_mod/files/PR07(KNN).py
+test_mod/files/PR08(SVM).py

test_graph2-0.1.0/test_graph2.egg-info/dependency_links.txt

@@ -0,0 +1 @@
+

test_graph2-0.1.0/test_graph2.egg-info/entry_points.txt

@@ -0,0 +1,2 @@
+[console_scripts]
+get-practicals = test_mod.cli:main

test_graph2-0.1.0/test_graph2.egg-info/requires.txt

@@ -0,0 +1,3 @@
+scikit-learn
+matplotlib
+numpy

test_graph2-0.1.0/test_graph2.egg-info/top_level.txt

@@ -0,0 +1 @@
+test_mod

test_graph2-0.1.0/test_mod/__init__.py

@@ -0,0 +1,3 @@
+from .cli import extract_files
+
+__all__ = ["extract_files"]

test_graph2-0.1.0/test_mod/__main__.py

@@ -0,0 +1,4 @@
+from .cli import main
+
+if __name__ == "__main__":
+    main()

test_graph2-0.1.0/test_mod/cli.py

@@ -0,0 +1,30 @@
+import os
+import shutil
+import sys
+from pathlib import Path
+
+def extract_files(destination=None):
+    if destination is None:
+        destination = os.getcwd()
+    
+    files_dir = Path(__file__).parent / "files"
+    if not files_dir.exists():
+        print("Error: Practical files directory not found.")
+        return
+        
+    created_files = []
+    for file_path in files_dir.glob("*.py"):
+        dest_file = Path(destination) / file_path.name
+        shutil.copy2(file_path, dest_file)
+        created_files.append(file_path.name)
+        print(f"  [+] Created: {file_path.name}")
+        
+    print(f"\n[OK] Successfully unpacked {len(created_files)} files into:\n     {destination}\n")
+
+def main():
+    dest = sys.argv[1] if len(sys.argv) > 1 else os.getcwd()
+    print("\n--- Extracting Practical Files ---")
+    extract_files(dest)
+
+if __name__ == "__main__":
+    main()

test_graph2-0.1.0/test_mod/files/PR01(BFS).py

@@ -0,0 +1,53 @@
+class First:
+    def __init__(self, graph, start, goal):
+        self.start = start
+        self.goal = goal
+        self.graph = graph
+
+    def bfs_shortest_path(self):
+
+        explored=[]
+        queue = [[self.start]]
+
+        if self.start == self.goal:
+            return "That Was Easy! Start = Goal"
+
+        while queue:
+            path = queue.pop(0)
+
+            node = path[-1]
+            neighbours = self.graph[node]
+
+            for neighbour in neighbours:
+                new_path = list(path)
+                new_path.append(neighbour)
+                queue.append(new_path)
+
+                if neighbour == self.goal:
+                    return new_path
+            explored.append(node)
+        return "So Sorry, But A Connecting Path doenst exist:("
+graph = {
+    "Arad": ["Zerind", "Sibiu", "Timisoara"],
+    "Zerind": ["Arad", "Oradea"],
+    "Oradea": ["Zerind", "Sibiu"],
+    "Sibiu": ["Arad", "Oradea", "Fagaras", "Rimnicu Vilcea"],
+    "Timisoara": ["Arad", "Lugoj"],
+    "Lugoj": ["Timisoara", "Mehadia"],
+    "Mehadia": ["Lugoj", "Drobeta"],
+    "Drobeta": ["Mehadia", "Craiova"],
+    "Craiova": ["Drobeta", "Rimnicu Vilcea", "Pitesti"],
+    "Rimnicu Vilcea": ["Sibiu", "Craiova", "Pitesti"],
+    "Fagaras": ["Sibiu", "Bucharest"],
+    "Pitesti": ["Rimnicu Vilcea", "Craiova", "Bucharest"],
+    "Bucharest": ["Fagaras", "Pitesti", "Giurgiu", "Urziceni"],
+    "Giurgiu": ["Bucharest"],
+    "Urziceni": ["Bucharest", "Hirsova", "Vaslui"],
+    "Hirsova": ["Urziceni", "Eforie"],
+    "Eforie": ["Hirsova"],
+    "Vaslui": ["Urziceni", "Iasi"],
+    "Iasi": ["Vaslui", "Neamt"],
+    "Neamt": ["Iasi"]
+    }
+f = First(graph,"Arad","Bucharest")
+print(f.bfs_shortest_path())

test_graph2-0.1.0/test_mod/files/PR01(IDFS).py

@@ -0,0 +1,39 @@
+graph = {'Arad': ['Zerind', 'Sibiu', 'Timisoara'],
+          'Bucharest': ['Urziceni','Pitesti', 'Giurgiu','Fagaras'],
+          'Craiova': ['Dobreta', 'Rimnicu Vilcea', 'Pitesti'],
+          'Dobreta': ['Mehadia'],
+          'Eforie': ['Hirsova'],
+          'Iasai': ['Vaslui','Neamt'],
+          'Lugoj': ['Timisoara','Mehadia'],
+          'Oradea': ['Zerind','Sibiu'],
+          'Pitesti': ['Rimnicu Vilcea'],
+          'Urziceni': ['Vaslui'],
+          'Zerind': ['Oradea','Arad'],
+          'Sibiu': ['Oradea','Arad','Rimnicu Vilcea','Fagaras'],
+          'Timisoara': ['Arad','Lugoj'],
+          'Mehadia': ['Lugoj','Dobreta'],
+          'Rimnicu Vilcea': ['Sibiu','Pitesti','Craiova'],
+          'Fagaras': ['Sibiu','Bucharest'],
+          'Giurgiu': ['Bucharest'],
+          'Vaslui': ['Urziceni','Iasai'],
+          'Neamt': ['Iasai']}
+def IDDFS(root, goal):
+     depth = 0
+     while True:
+         print ("Looping at depth %i " % (depth))
+         result = DLS(root, goal, depth)
+         print ("Result: %s, Goal: %s" % (result, goal))
+         if result == goal:
+             return result
+         depth = depth +1
+def DLS(node, goal, depth):
+     print ("node: %s, goal %s, depth: %i" % (node, goal, depth))
+     if depth == 0 and node == goal:
+         print (" --- Found goal, returning --- ")
+         return node
+     elif depth > 0:
+        print ("Looping through children: %s" % (graph.get(node, [])))
+        for child in graph.get(node, []):
+            if goal == DLS(child, goal, depth-1):
+                return goal
+IDDFS('Arad', 'Bucharest')

test_graph2-0.1.0/test_mod/files/PR02(A star).py

@@ -0,0 +1,93 @@
+graph={'Arad':['Zerind','Sibiu','Timisora'],
+     'Bucharest':['Urziceni','Pitesti','Giurgiu','Fagaras'],
+     'Craiova':['Drobeta','Rimnicu Vilcea','Pitesti'],
+     'Drobeta':['Mehadia','Craiova'],
+     'Eforie':['Hirsova'],
+     'Iasai':['Vaslui','Neamt'],
+     'Lugoj':['Timisora','Mehadia'],
+     'Oradea':['Zerind','Sibiu'],
+     'Pitesti':['Rimnicu Vilcea',
+     'Craiova','Bucharest'],
+     'Urziceni':['Vaslui'],
+     'Zerind':['Oradea','Arad'],
+     'Sibiu':['Oradea','Arad','Rimnicu Vilcea','Fagaras'],
+     'Timisora':['Arad','Lugoj'],
+     'Mehadia':['Lugoj','Drobeta'],
+     'Rimnicu Vilcea':['Sibiu','Pitesti','Craiova'],
+     'Fagaras':['Sibiu','Bucharest'],
+     'Giurgiu':['Bucharest'],
+     'Vaslui':['Urziceni','Iasai'],
+     'Neamt':['Iasai']} 
+pc={('Arad','Zerind'):75,
+     ('Arad','Timisora'):118,
+     ('Arad','Sibiu'):140,
+     ('Zerind','Oradea'):75,
+     ('Zerind','Arad'):75,
+     ('Timisora','Arad'):118,
+     ('Timisora','Lugoj'):111,
+     ('Sibiu','Arad'):140,
+     ('Sibiu','Fagaras'):99,
+     ('Sibiu','Oradea'):151,
+     ('Lugoj','Timisora'):111,
+     ('Lugoj','Mehadia'):70,
+     ('Rimnicu Vilcea','Sibiu'):80,
+     ('Sibiu','Rimnicu Vilcea'):80,
+     ('Rimnicu Vilcea','Pitesti'):97,
+     ('Rimnicu Vilcea','Craiova'):146,
+     ('Fagaras','Sibiu'):99,
+     ('Pitesti','Craiova'):138,
+     ('Pitesti','Bucharest'):101,
+     ('Craiova','Rimnicu Vilcea'):146,
+     ('Craiova','Drobeta'):120,
+     ('Craiova','Pitesti'):138,
+     ('Bucharest','Fagaras'):211,
+     ('Bucharest','Bucharest'):0,
+     ('Bucharest','Pitesti'):101,
+     ('Bucharest','Giurgiu'):90,
+     ('Bucharest','Urziceni'):85,
+     ('Giurgiu','Bucharest'):90,
+     ('Urziceni','Bucharest'):85,
+     ('Urziceni','Vaslui'):142,
+     ('Hirsova','Eforie'):86,
+     ('Vaslui','Urziceni'):142,
+     ('Vaslui','Iasai'):92,
+     ('Iasai','Vaslui'):92,
+     ('Iasai','Neamt'):87,
+     ('Neamt','Iasai'):87} 
+locs={'Arad':36,
+       'Bucharest':0,
+       'Craiova':160,
+       'Drobeta':242,
+       'Eforie':161,
+       'Iasai':226,
+       'Lugoj':244,
+       'Oradea':380,
+       'Pitesti':100,
+       'Urziceni':80,
+       'Zerind':374,
+       'Sibiu':253,
+       'Timisora':329,
+       'Mehadia':241,
+       'Rimnicu Vilcea':193,
+       'Fagaras':176,
+       'Giurgiu':77,
+       'Vaslui':199,
+       'Neamt':234,
+       'Hirsova':151}
+
+def DFS(g,v,goal,explored,path_so_far,m):
+     explored.add(v)
+     if v==goal:
+         return path_so_far + "->"+v
+     node=None
+     for w in g[v]:
+         if w not in explored:
+             f=locs[w]+pc[(v,w)]
+             if m>f:
+                m=f
+                node=w
+                print(m,v,w)
+     if node is not None:
+         return DFS(g,node,goal,explored,path_so_far+"->"+v,m)
+         return 
+print(DFS(graph,'Arad','Bucharest',set()," ",1000))

test_graph2-0.1.0/test_mod/files/PR05(Adaboost).py

@@ -0,0 +1,21 @@
+from sklearn.ensemble import AdaBoostClassifier
+from sklearn import datasets 
+from sklearn.model_selection import train_test_split 
+from sklearn import metrics   
+
+iris = datasets.load_iris() 
+
+X = iris.data 
+y = iris.target 
+
+X_train, X_test, y_train, y_test = train_test_split(X, y, test_size=0.3) # 70% training and 30% test
+
+abc = AdaBoostClassifier(n_estimators=50,learning_rate=1) 
+print(abc) 
+
+model = abc.fit(X_train, y_train) 
+print(model) 
+
+y_pred = model.predict(X_test) 
+print(model) 
+print("Accuracy:",metrics.accuracy_score(y_test, y_pred))

test_graph2-0.1.0/test_mod/files/PR07(KNN).py

@@ -0,0 +1,18 @@
+import matplotlib.pyplot as plt 
+x = [4, 5, 10, 4, 3, 11, 14 , 8, 10, 12] 
+y = [21, 19, 24, 17, 16, 25, 24, 22, 21, 21] 
+classes = [0, 0, 1, 0, 0, 1, 1, 0, 1, 1]  
+
+plt.scatter(x, y, c=classes) 
+plt.show() 
+
+from sklearn.neighbors import KNeighborsClassifier  
+data = list(zip(x, y)) 
+knn = KNeighborsClassifier(n_neighbors=1)  
+knn.fit(data, classes) 
+new_x = 8 
+new_y = 21 
+new_point = [(new_x, new_y)]  
+prediction = knn.predict(new_point)  
+plt.scatter(x + [new_x], y + [new_y], c=classes + [prediction[0]]) 
+plt.text(x=new_x-1.7, y=new_y-0.7, s=f"new point, class: {prediction[0]}")

test_graph2-0.1.0/test_mod/files/PR08(SVM).py

@@ -0,0 +1,21 @@
+from sklearn.datasets import make_blobs  
+X, Y = make_blobs(n_samples=500, centers=2,random_state=0, cluster_std=0.40) 
+import matplotlib.pyplot as plt 
+
+# plotting scatters  
+plt.scatter(X[:, 0], X[:, 1], c=Y, s=50, cmap='spring'); 
+plt.show() 
+import numpy as np 
+xfit = np.linspace(-1, 3.5)   
+
+# plotting scatter
+plt.scatter(X[:, 0], X[:, 1], c=Y, s=50, cmap='spring')   
+
+# plot a line between the different sets of data 
+for m, b, d in [(1, 0.65, 0.33), (0.5, 1.6, 0.55), (-0.2, 2.9, 0.2)]:
+    yfit = m * xfit + b
+    plt.plot(xfit, yfit, '-k')
+    plt.fill_between(xfit, yfit - d, yfit + d, edgecolor='none',color='#AAAAAA', alpha=0.4)   
+plt.xlim(-1, 3.5); 
+plt.show() 
+print (X),(Y)