noshot 0.1.0__py3-none-any.whl

noshot/__init__.py

@@ -0,0 +1 @@
+from .main import get

noshot/data/AIDS CN NLP/AIDS/1. Implement Basic Search Strategies/(A) Breadth First Search.ipynb

@@ -0,0 +1,112 @@
+{
+ "cells": [
+  {
+   "cell_type": "code",
+   "execution_count": null,
+   "id": "d2b42a21-ddab-46e8-9926-fb21c7209107",
+   "metadata": {},
+   "outputs": [],
+   "source": [
+    "import networkx as nx\n",
+    "import matplotlib.pyplot as plt\n",
+    "\n",
+    "def display(graph, directed = False):\n",
+    "    g = nx.DiGraph(graph) if directed else nx.Graph(graph)\n",
+    "    nx.draw(g, with_labels = True)\n",
+    "    plt.suptitle(\"Breadth First Search\")\n",
+    "    plt.show()\n",
+    "    plt.clf()\n",
+    "def print_path(node, parent):\n",
+    "    if node != None:\n",
+    "        return print_path(parent[node], parent) + [node]\n",
+    "    return []\n",
+    "def BFS(graph, start, goal):\n",
+    "    queue = [start]\n",
+    "    visited = []\n",
+    "    parent = {start : None}\n",
+    "    while queue:\n",
+    "        node = queue.pop(0)#First element\n",
+    "        visited.append(node)\n",
+    "        if node == goal:\n",
+    "            print(f\"Result(BFS {start} to {goal}):\",print_path(node, parent))\n",
+    "            return True \n",
+    "        for adj in graph[node]:\n",
+    "            if adj not in visited and adj not in queue:\n",
+    "                queue.append(adj)\n",
+    "                parent[adj] = node\n",
+    "    print(f\"Result(BFS {start} to {goal}): No Solution\")\n",
+    "    return False\n",
+    "def get_graph(directed = False):\n",
+    "    graph = {}\n",
+    "    print(\"Enter edge (u, v)\")\n",
+    "    print(\"[PRESS ENTER TO STOP]\")\n",
+    "    x = input()\n",
+    "    while x:\n",
+    "        x = x.split(maxsplit = 1)\n",
+    "        u, adj = x[0], {v.strip() for v in x[1].strip(' []').split(',') if v}\n",
+    "        graph[u] = graph.get(u,set()) | adj\n",
+    "        for v in adj:\n",
+    "            graph[v] = graph.get(v,set()) | ({u} if not directed else set())\n",
+    "        x = input()\n",
+    "    return graph\n",
+    "def example():\n",
+    "    graph = {\"A\" : [\"B\",\"C\",\"D\"],\n",
+    "             \"B\" : [\"A\",\"E\"],\n",
+    "             \"C\" : [\"A\",\"E\",\"F\"],\n",
+    "             \"D\" : [\"A\",\"F\"],\n",
+    "             \"E\" : [\"B\",\"G\",\"C\"],\n",
+    "             \"F\" : [\"D\",\"C\",\"G\"],\n",
+    "             \"G\" : [\"E\",\"F\"]}\n",
+    "    display(graph)\n",
+    "    print(graph)\n",
+    "    BFS(graph, \"A\", \"F\")\n",
+    "    \n",
+    "def main():\n",
+    "    #example();return #Uncomment to run the example\n",
+    "    graph = get_graph(directed = False)#undirected graph\n",
+    "    source, goal = input(\"Enter source and goal: \").split()\n",
+    "    display(graph, directed = False)\n",
+    "    print(graph)\n",
+    "    BFS(graph, source, goal)\n",
+    "    \n",
+    "    #Sample output\n",
+    "    #Enter edge (u, v)\n",
+    "    #[PRESS ENTER TO STOP]\n",
+    "    #A B\n",
+    "    #A C\n",
+    "    #A D\n",
+    "    #B E\n",
+    "    #C E\n",
+    "    #C F\n",
+    "    #D F\n",
+    "    #E G\n",
+    "    #F G\n",
+    "\n",
+    "    #Enter source and goal: A F\n",
+    "    #Result(BFS A to F): ['A', 'D', 'F']\n",
+    "main()"
+   ]
+  }
+ ],
+ "metadata": {
+  "kernelspec": {
+   "display_name": "Python 3 (ipykernel)",
+   "language": "python",
+   "name": "python3"
+  },
+  "language_info": {
+   "codemirror_mode": {
+    "name": "ipython",
+    "version": 3
+   },
+   "file_extension": ".py",
+   "mimetype": "text/x-python",
+   "name": "python",
+   "nbconvert_exporter": "python",
+   "pygments_lexer": "ipython3",
+   "version": "3.12.4"
+  }
+ },
+ "nbformat": 4,
+ "nbformat_minor": 5
+}

noshot/data/AIDS CN NLP/AIDS/1. Implement Basic Search Strategies/(B) Depth First Search.ipynb

@@ -0,0 +1,111 @@
+{
+ "cells": [
+  {
+   "cell_type": "code",
+   "execution_count": null,
+   "id": "a5759a8d-8689-4924-ae96-afd00a7f2910",
+   "metadata": {},
+   "outputs": [],
+   "source": [
+    "import networkx as nx\n",
+    "import matplotlib.pyplot as plt\n",
+    "def display(graph, directed = False):\n",
+    "    g = nx.DiGraph(graph) if directed else nx.Graph(graph)\n",
+    "    nx.draw(g, with_labels = True)\n",
+    "    plt.suptitle(\"Depth First Search\")\n",
+    "    plt.show()\n",
+    "    plt.clf()\n",
+    "def print_path(node, parent):\n",
+    "    if node != None:\n",
+    "        return print_path(parent[node], parent) + [node]\n",
+    "    return []\n",
+    "def DFS(graph, start, goal):\n",
+    "    stack = [start]\n",
+    "    visited = []\n",
+    "    parent = {start : None}\n",
+    "    while stack:\n",
+    "        node = stack.pop()#last element\n",
+    "        visited.append(node)\n",
+    "        if node == goal:\n",
+    "            print(f\"Result(DFS {start} to {goal}):\",print_path(node, parent))\n",
+    "            return True\n",
+    "        for adj in graph[node]:\n",
+    "            if adj not in visited and adj not in stack:\n",
+    "                stack.append(adj)\n",
+    "                parent[adj] = node\n",
+    "    print(f\"Result(DFS {start} to {goal}): No Solution\")\n",
+    "    return False\n",
+    "def get_graph(directed = False):\n",
+    "    graph = {}\n",
+    "    print(\"Enter edge (u, v)\")\n",
+    "    print(\"[PRESS ENTER TO STOP]\")\n",
+    "    x = input()\n",
+    "    while x:\n",
+    "        x = x.split(maxsplit = 1)\n",
+    "        u, adj = x[0], {v.strip() for v in x[1].strip(' []').split(',') if v}\n",
+    "        graph[u] = graph.get(u,set()) | adj\n",
+    "        for v in adj:\n",
+    "            graph[v] = graph.get(v,set()) | ({u} if not directed else set())\n",
+    "        x = input()\n",
+    "    return graph\n",
+    "def example():\n",
+    "    graph = {\"A\" : [\"B\",\"C\",\"D\"],\n",
+    "             \"B\" : [\"A\",\"E\"],\n",
+    "             \"C\" : [\"A\",\"E\",\"F\"],\n",
+    "             \"D\" : [\"A\",\"F\"],\n",
+    "             \"E\" : [\"B\",\"G\",\"C\"],\n",
+    "             \"F\" : [\"D\",\"C\",\"G\"],\n",
+    "             \"G\" : [\"E\",\"F\"]}\n",
+    "    display(graph)\n",
+    "    print(graph)\n",
+    "    DFS(graph, \"A\", \"F\")\n",
+    "\n",
+    "def main():\n",
+    "    #example();return #Uncomment to run the example\n",
+    "    graph = get_graph(directed = False)#undirected graph\n",
+    "    source, goal = input(\"Enter source and goal: \").split()\n",
+    "    display(graph, directed = False)\n",
+    "    print(graph)\n",
+    "    DFS(graph, source, goal)\n",
+    "\n",
+    "    #Sample output\n",
+    "    #Enter edge (u, v)\n",
+    "    #[PRESS ENTER TO STOP]\n",
+    "    #A B\n",
+    "    #A C\n",
+    "    #A D\n",
+    "    #B E\n",
+    "    #C E\n",
+    "    #C F\n",
+    "    #D F\n",
+    "    #E G\n",
+    "    #F G\n",
+    "\n",
+    "    #Enter source and goal: A F\n",
+    "    #Result(DFS A to F): ['A', 'B', 'E', 'G', 'F']\n",
+    "main()"
+   ]
+  }
+ ],
+ "metadata": {
+  "kernelspec": {
+   "display_name": "Python 3 (ipykernel)",
+   "language": "python",
+   "name": "python3"
+  },
+  "language_info": {
+   "codemirror_mode": {
+    "name": "ipython",
+    "version": 3
+   },
+   "file_extension": ".py",
+   "mimetype": "text/x-python",
+   "name": "python",
+   "nbconvert_exporter": "python",
+   "pygments_lexer": "ipython3",
+   "version": "3.12.4"
+  }
+ },
+ "nbformat": 4,
+ "nbformat_minor": 5
+}

noshot/data/AIDS CN NLP/AIDS/1. Implement Basic Search Strategies/(C) Uniform Cost Search.ipynb

@@ -0,0 +1,134 @@
+{
+ "cells": [
+  {
+   "cell_type": "code",
+   "execution_count": null,
+   "id": "500c2d15-c6aa-4dc6-869a-ab13b598cf36",
+   "metadata": {},
+   "outputs": [],
+   "source": []
+  },
+  {
+   "cell_type": "code",
+   "execution_count": null,
+   "id": "1ee3b7e9-ef2b-4e25-b40c-89b66bfb7d09",
+   "metadata": {},
+   "outputs": [],
+   "source": [
+    "import networkx as nx\n",
+    "import matplotlib.pyplot as plt\n",
+    "def display(graph, directed = False):\n",
+    "    graph = {u : {v : {'weight' : graph[u][v]} for v in graph[u]} for u in graph}\n",
+    "    g = nx.from_dict_of_dicts(graph)\n",
+    "    pos = nx.circular_layout(g)\n",
+    "    nx.draw(g, pos, with_labels = True)\n",
+    "    nx.draw_networkx_edge_labels(g, pos, edge_labels = nx.get_edge_attributes(g, 'weight'))\n",
+    "    plt.suptitle(\"Uniform Cost Search\")\n",
+    "    plt.show()\n",
+    "    plt.clf()\n",
+    "def print_path(node, parent):\n",
+    "    if node != None:\n",
+    "        return print_path(parent[node], parent) + [node]\n",
+    "    return []\n",
+    "def UCS(graph, start, goal):\n",
+    "    queue = [start]\n",
+    "    visited = []\n",
+    "    parent = {start : None}\n",
+    "    cost = {start : 0}\n",
+    "    while queue:\n",
+    "        queue.sort(key = lambda x : cost[x])\n",
+    "        node = queue.pop(0)\n",
+    "        visited.append(node)\n",
+    "        if node == goal:\n",
+    "            print(f\"Result(UCS {start} to {goal}):\",print_path(node, parent),\"Path cost =\",cost[node])\n",
+    "            return True\n",
+    "        for adj in graph[node]:\n",
+    "            if adj not in visited:\n",
+    "                new_cost = cost[node] + graph[node][adj]\n",
+    "                if adj not in queue:\n",
+    "                    queue.append(adj)\n",
+    "                elif new_cost > cost[adj]:\n",
+    "                    continue\n",
+    "                cost[adj] = new_cost\n",
+    "                parent[adj] = node\n",
+    "    print(f\"Result(UCS {start} to {goal}): No Solution\")\n",
+    "    return False\n",
+    "def get_graph(directed = False):\n",
+    "    graph = {}\n",
+    "    print(\"Enter edge (u, v, weight)\")\n",
+    "    print(\"[PRESS ENTER TO STOP]\")\n",
+    "    x = input()\n",
+    "    while x:\n",
+    "        x = x.split(maxsplit = 1)\n",
+    "        u, adj = x[0], [v.strip(' ()') for v in x[1].strip('[]').split(',') if v] \n",
+    "        if len(adj) == 1:\n",
+    "            v, w = adj[0].split()\n",
+    "            adj = {v : int(w)}\n",
+    "        else:\n",
+    "            adj = {v : int(w) for v, w in zip(adj[::2],adj[1::2])}\n",
+    "        graph[u] = graph.get(u, {}) | adj\n",
+    "        for v, w in adj.items():\n",
+    "            graph[v] = graph.get(v, {}) | ({u : w} if not directed else {})\n",
+    "        x = input()\n",
+    "    return graph\n",
+    "def example():\n",
+    "    graph = {\"A\" : {\"B\":9,\"C\":4,\"D\":7},\n",
+    "             \"B\" : {\"A\":9,\"E\":11},\n",
+    "             \"C\" : {\"A\":4,\"E\":17,\"F\":12},\n",
+    "             \"D\" : {\"A\":7,\"F\":14},\n",
+    "             \"E\" : {\"B\":11,\"G\":5,\"C\":17},\n",
+    "             \"F\" : {\"D\":14,\"C\":12,\"G\":9},\n",
+    "             \"G\" : {\"E\":5,\"F\":9}}\n",
+    "    display(graph)\n",
+    "    print(graph)\n",
+    "    UCS(graph, \"A\", \"G\")\n",
+    "\n",
+    "def main():\n",
+    "    #example();return #Uncomment to run the example\n",
+    "    graph = get_graph(directed = False)#undirected graph\n",
+    "    source, goal = input(\"Enter source and goal: \").split()\n",
+    "    display(graph, directed = False)\n",
+    "    print(graph)\n",
+    "    UCS(graph, source, goal)\n",
+    "\n",
+    "    #Sample output\n",
+    "    #Enter edge (u, v, weight) \n",
+    "    #[Press Enter To Stop]\n",
+    "    #A B 9\n",
+    "    #A C 4\n",
+    "    #A D 7\n",
+    "    #B E 11\n",
+    "    #C E 17\n",
+    "    #C F 12\n",
+    "    #D F 14\n",
+    "    #E G 5\n",
+    "    #F G 9\n",
+    " \n",
+    "    #Enter source and goal:  A G\n",
+    "    #Result(UCS A to G): ['A', 'B', 'E', 'G'] Path cost = 25\n",
+    "main()"
+   ]
+  }
+ ],
+ "metadata": {
+  "kernelspec": {
+   "display_name": "Python 3 (ipykernel)",
+   "language": "python",
+   "name": "python3"
+  },
+  "language_info": {
+   "codemirror_mode": {
+    "name": "ipython",
+    "version": 3
+   },
+   "file_extension": ".py",
+   "mimetype": "text/x-python",
+   "name": "python",
+   "nbconvert_exporter": "python",
+   "pygments_lexer": "ipython3",
+   "version": "3.12.4"
+  }
+ },
+ "nbformat": 4,
+ "nbformat_minor": 5
+}

noshot/data/AIDS CN NLP/AIDS/1. Implement Basic Search Strategies/(D) Depth Limites Search.ipynb

@@ -0,0 +1,115 @@
+{
+ "cells": [
+  {
+   "cell_type": "code",
+   "execution_count": null,
+   "id": "ddb94be1-e76f-45bf-9c2f-2e02f4a98a9f",
+   "metadata": {},
+   "outputs": [],
+   "source": [
+    "import networkx as nx\n",
+    "import matplotlib.pyplot as plt\n",
+    "def display(graph, directed = False):\n",
+    "    g = nx.DiGraph(graph) if directed else nx.Graph(graph)\n",
+    "    nx.draw(g, with_labels = True)\n",
+    "    plt.suptitle(\"Depth Limited Search\")\n",
+    "    plt.show()\n",
+    "    plt.clf()\n",
+    "def print_path(node, parent):\n",
+    "    if node != None:\n",
+    "        return print_path(parent[node], parent) + [node]\n",
+    "    return []\n",
+    "def DLS(graph, start, goal, limit):\n",
+    "    result = recursive_dls(graph, start, goal, limit, [start])\n",
+    "    print(f\"Result(DLS {start} to {goal}):\",result,\"at depth limit =\",limit)\n",
+    "def recursive_dls(graph, node, goal, limit, visited):\n",
+    "    if node == goal:\n",
+    "        return [node]\n",
+    "    elif limit == 0:\n",
+    "        return 'cutoff'\n",
+    "    else:\n",
+    "        status = 'failure'\n",
+    "        for adj in graph[node]:\n",
+    "            if adj not in visited:\n",
+    "                visited.append(adj)\n",
+    "                result = recursive_dls(graph, adj, goal, limit - 1, visited)\n",
+    "                if result == 'cutoff':\n",
+    "                    status = 'cutoff'\n",
+    "                    visited.remove(adj)\n",
+    "                elif result != 'failure':\n",
+    "                    return [node] + result\n",
+    "        return status\n",
+    "def get_graph(directed = False):\n",
+    "    graph = {}\n",
+    "    print(\"Enter edge (u, v)\")\n",
+    "    print(\"[PRESS ENTER TO STOP]\")\n",
+    "    x = input()\n",
+    "    while x:\n",
+    "        x = x.split(maxsplit = 1)\n",
+    "        u, adj = x[0], {v.strip() for v in x[1].strip(' []').split(',') if v}\n",
+    "        graph[u] = graph.get(u,set()) | adj\n",
+    "        for v in adj:\n",
+    "            graph[v] = graph.get(v,set()) | ({u} if not directed else set())\n",
+    "        x = input()\n",
+    "    return graph\n",
+    "def example():\n",
+    "    graph = {\"A\" : [\"B\",\"C\",\"D\"],\n",
+    "             \"B\" : [\"A\",\"E\"],\n",
+    "             \"C\" : [\"A\",\"E\",\"F\"],\n",
+    "             \"D\" : [\"A\",\"F\"],\n",
+    "             \"E\" : [\"B\",\"G\",\"C\"],\n",
+    "             \"F\" : [\"D\",\"C\",\"G\"],\n",
+    "             \"G\" : [\"E\",\"F\"]}\n",
+    "    display(graph)\n",
+    "    print(graph)\n",
+    "    DLS(graph, \"A\", \"F\", 3)\n",
+    "\n",
+    "def main():\n",
+    "    #example();return #Uncomment to run the example\n",
+    "    graph = get_graph(directed = False)#undirected graph\n",
+    "    source, goal, limit = input(\"Enter source, goal and depthlimit: \").split() \n",
+    "    display(graph, directed = False)\n",
+    "    print(graph)\n",
+    "    DLS(graph, source, goal, int(limit))\n",
+    "\n",
+    "    #Sample output\n",
+    "    #Enter edge (u, v)\n",
+    "    #[Press Enter To Stop]\n",
+    "    #A B\n",
+    "    #A C\n",
+    "    #A D\n",
+    "    #B E\n",
+    "    #C E\n",
+    "    #C F\n",
+    "    #D F\n",
+    "    #E G\n",
+    "    #F G\n",
+    "\n",
+    "    #Enter source, goal and depthlimit:  A G 3\n",
+    "    #Result(DLS A to G): ['A', 'D', 'F', 'G'] at depth limit = 3\n",
+    "main()"
+   ]
+  }
+ ],
+ "metadata": {
+  "kernelspec": {
+   "display_name": "Python 3 (ipykernel)",
+   "language": "python",
+   "name": "python3"
+  },
+  "language_info": {
+   "codemirror_mode": {
+    "name": "ipython",
+    "version": 3
+   },
+   "file_extension": ".py",
+   "mimetype": "text/x-python",
+   "name": "python",
+   "nbconvert_exporter": "python",
+   "pygments_lexer": "ipython3",
+   "version": "3.12.4"
+  }
+ },
+ "nbformat": 4,
+ "nbformat_minor": 5
+}

noshot/data/AIDS CN NLP/AIDS/1. Implement Basic Search Strategies/(E) Iterative Deepening DFS.ipynb

@@ -0,0 +1,123 @@
+{
+ "cells": [
+  {
+   "cell_type": "code",
+   "execution_count": null,
+   "id": "604537d7-a687-4bb1-b77f-aae948b257f0",
+   "metadata": {},
+   "outputs": [],
+   "source": [
+    "import networkx as nx\n",
+    "import matplotlib.pyplot as plt\n",
+    "def display(graph, directed = False):\n",
+    "    g = nx.DiGraph(graph) if directed else nx.Graph(graph)\n",
+    "    nx.draw(g, with_labels = True)\n",
+    "    plt.suptitle(\"Iterative Deepening Depth First Search\")\n",
+    "    plt.show()\n",
+    "    plt.clf()\n",
+    "def print_path(node, parent):\n",
+    "    if node != None:\n",
+    "        return print_path(parent[node], parent) + [node]\n",
+    "    return []\n",
+    "def IDS(graph, start, goal):\n",
+    "    depth = 0\n",
+    "    while True:\n",
+    "        result = recursive_dls(graph, start, goal, depth, [start])\n",
+    "        print(f\"Result(IDS/IDDFS {start} to {goal}):\",result,\"at depth limit =\",depth)\n",
+    "        if result != 'cutoff':\n",
+    "            return\n",
+    "        depth += 1\n",
+    "def recursive_dls(graph, node, goal, limit, visited):\n",
+    "    if node == goal:\n",
+    "        return [node]\n",
+    "    elif limit == 0:\n",
+    "        return 'cutoff'\n",
+    "    else:\n",
+    "        status = 'failure'\n",
+    "        for adj in graph[node]:\n",
+    "            if adj not in visited:\n",
+    "                visited.append(adj)\n",
+    "                result = recursive_dls(graph, adj, goal, limit - 1, visited)\n",
+    "                if result == 'cutoff':\n",
+    "                    status = 'cutoff'\n",
+    "                    visited.remove(adj)\n",
+    "                elif result != 'failure':\n",
+    "                    return [node] + result\n",
+    "        return status\n",
+    "def get_graph(directed = False):\n",
+    "    graph = {}\n",
+    "    print(\"Enter edge (u, v)\")\n",
+    "    print(\"[PRESS ENTER TO STOP]\")\n",
+    "    x = input()\n",
+    "    while x:\n",
+    "        x = x.split(maxsplit = 1)\n",
+    "        u, adj = x[0], {v.strip() for v in x[1].strip(' []').split(',') if v}\n",
+    "        graph[u] = graph.get(u,set()) | adj\n",
+    "        for v in adj:\n",
+    "            graph[v] = graph.get(v,set()) | ({u} if not directed else set())\n",
+    "        x = input()\n",
+    "    return graph\n",
+    "def example():\n",
+    "    graph = {\"A\" : [\"B\",\"C\",\"D\"],\n",
+    "             \"B\" : [\"A\",\"E\"],\n",
+    "             \"C\" : [\"A\",\"E\",\"F\"],\n",
+    "             \"D\" : [\"A\",\"F\"],\n",
+    "             \"E\" : [\"B\",\"G\",\"C\"],\n",
+    "             \"F\" : [\"D\",\"C\",\"G\"],\n",
+    "             \"G\" : [\"E\",\"F\"]}\n",
+    "    display(graph)\n",
+    "    print(graph)\n",
+    "    IDS(graph, \"A\", \"F\", 3)\n",
+    "\n",
+    "def main():\n",
+    "    #example();return #Uncomment to run the example\n",
+    "    graph = get_graph(directed = False)#undirected graph\n",
+    "    source, goal = input(\"Enter source, goal: \").split() \n",
+    "    display(graph, directed = False)\n",
+    "    print(graph)\n",
+    "    IDS(graph, source, goal)\n",
+    "\n",
+    "    #Sample output\n",
+    "    #Enter edge (u, v)\n",
+    "    #[PRESS ENTER TO STOP]\n",
+    "    #A B\n",
+    "    #A C\n",
+    "    #A D\n",
+    "    #B E\n",
+    "    #C E\n",
+    "    #C F\n",
+    "    #D F\n",
+    "    #E G\n",
+    "    #F G\n",
+    " \n",
+    "    #Enter source, goal:  A G\n",
+    "    #Result(IDS/IDDFS): cutoff at depth limit = 0\n",
+    "    #Result(IDS/IDDFS): cutoff at depth limit = 1\n",
+    "    #Result(IDS/IDDFS): cutoff at depth limit = 2\n",
+    "    #Result(IDS/IDDFS): ['A', 'D', 'F', 'G'] at depth limit = 3\n",
+    "main()"
+   ]
+  }
+ ],
+ "metadata": {
+  "kernelspec": {
+   "display_name": "Python 3 (ipykernel)",
+   "language": "python",
+   "name": "python3"
+  },
+  "language_info": {
+   "codemirror_mode": {
+    "name": "ipython",
+    "version": 3
+   },
+   "file_extension": ".py",
+   "mimetype": "text/x-python",
+   "name": "python",
+   "nbconvert_exporter": "python",
+   "pygments_lexer": "ipython3",
+   "version": "3.12.4"
+  }
+ },
+ "nbformat": 4,
+ "nbformat_minor": 5
+}