ai.ipynb

{
 "cells": [
  {
   "cell_type": "code",
   "execution_count": 2,
   "metadata": {},
   "outputs": [
    {
     "name": "stdout",
     "output_type": "stream",
     "text": [
      "MONDAY:\n",
      "- POTENTIAL MEETING at: 13\n",
      "- POTENTIAL MEETING at: 15\n",
      "TUESDAY:\n",
      "- POTENTIAL MEETING at: 11\n",
      "WEDNESDAY:\n",
      "THURSDAY:\n",
      "- POTENTIAL MEETING at: 13\n",
      "FRIDAY:\n",
      "- POTENTIAL MEETING at: 8\n",
      "- POTENTIAL MEETING at: 9\n",
      "- POTENTIAL MEETING at: 11\n"
     ]
    }
   ],
   "source": [
    "from itertools import product\n",
    "conf_room = [\n",
    "    [8, 9, 13, 15],\n",
    "    [9, 11, 16],\n",
    "    [8, 9, 10, 12 ],\n",
    "    [10, 12, 13,15, 16],\n",
    "    [8, 9, 10, 11, 12, 13, 14, 15, 16]\n",
    "]\n",
    "\n",
    "yourself = [\n",
    "    [8, 12, 13, 15, 16],\n",
    "    [8, 9, 11, 13, 14],\n",
    "    [8, 12, 13, 15, 16],\n",
    "    [8, 9, 11, 13, 14],\n",
    "    [8, 9, 11, 13, 14, 15 ]\n",
    "]\n",
    "\n",
    "anna = [\n",
    "    [9, 10, 11, 13, 15],\n",
    "    [9, 11, 16],\n",
    "    [9, 10, 11],\n",
    "    [9, 10, 13],\n",
    "    [8, 9, 11, 12, 15]\n",
    "]\n",
    "\n",
    "bob = [\n",
    "    [10, 11, 13, 15],\n",
    "    [8, 9, 10, 11],\n",
    "    [10, 11, 13, 15 ],\n",
    "    [8, 9, 13, 15],\n",
    "    [8, 9, 11, 13]\n",
    "]\n",
    "\n",
    "carrie = [\n",
    "    [8, 9, 10, 13, 14, 15],\n",
    "    [11, 12, 13, 14, 15],\n",
    "    [8, 9, 10, 13, 14],\n",
    "    [12, 13, 14, 15],\n",
    "    [8, 9, 10, 11, 13]\n",
    "]\n",
    "\n",
    "\n",
    "\n",
    "def goal(*args):\n",
    "    return len(set(args)) == 1\n",
    "    \n",
    "\n",
    "# def generateAndTest (l1,l2,l3,l4,l5, goal):\n",
    "#     for i in l1:\n",
    "#         for j in l2:\n",
    "#             for k in l3:\n",
    "#                 for l in l4:\n",
    "#                     for m in l5:\n",
    "#                         if goal(i,j,k,l,m):\n",
    "#                             print ('- POTENTIAL MEETING at:', i)\n",
    "                            \n",
    "# for n,l in enumerate(zip(*schedule)):\n",
    "#     print(days[n]+':')\n",
    "#     generateAndTest2(*l, goal=goal)\n",
    "    \n",
    "\n",
    "def generateAndTest2 (*args, goal):\n",
    "    for i in list(product(*args)):\n",
    "        if goal(*i):\n",
    "            print ('- POTENTIAL MEETING at:', i[0])\n",
    "                   \n",
    "                \n",
    "schedule = [conf_room, yourself, anna, bob, carrie]\n",
    "days = ['MONDAY','TUESDAY','WEDNESDAY','THURSDAY','FRIDAY']\n",
    "\n",
    "for n,l in enumerate(zip(*schedule)):\n",
    "    print(days[n]+':')\n",
    "    generateAndTest2(*l, goal=goal)"
   ]
  },
  {
   "cell_type": "code",
   "execution_count": 20,
   "metadata": {},
   "outputs": [
    {
     "name": "stdout",
     "output_type": "stream",
     "text": [
      "FULL PATH: C:\\\\Users\\\\OMIGIEO\\\\Google Drive\\\\etsu\\\\weekend course\\\\algo\\\\ai\\\\treepath\\treepath\\daex\\yN\\mD 6\\xbVbur\\oxi\\au\\Oi\\LOPwwLQH\\nVWT\n",
      "BREADTH-FIRST SEARCH AVERAGE TIME: 105.699 ms\n",
      "DEPTH-FIRST SEARCH AVERAGE TIME: 181.397 ms\n"
     ]
    }
   ],
   "source": [
    "import os\n",
    "import time\n",
    "import numpy\n",
    "from queue import PriorityQueue\n",
    "from collections import deque\n",
    "\n",
    "# ==============================================================================\n",
    "# Goal: Traverse a directory structure using Depth-First and Breadth-First\n",
    "#        Search Algorithms\n",
    "# ==============================================================================\n",
    "\n",
    "# ---------------------------------------\n",
    "# The Path to Search\n",
    "#  You may need to alter this based on\n",
    "#   your file location and OS.\n",
    "path = \"treepath\"\n",
    "BASE_PATH = r\"C:\\\\Users\\\\OMIGIEO\\\\Google Drive\\\\etsu\\\\weekend course\\\\algo\\\\ai\\\\treepath\"\n",
    "# ---------------------------------------\n",
    "# The Goal Filename\n",
    "#  This is the name of the files you are\n",
    "#   attempting to find.\n",
    "\n",
    "\n",
    "# ===============================================================================\n",
    "# Method: method_timing\n",
    "#  Purpose: A timing function that wraps the called method with timing code.\n",
    "#     Uses: time.time(), used to determine the time before an after a call to\n",
    "#            func, and then returns the difference.\n",
    "def method_timing(func):\n",
    "    def wrapper(*arg):\n",
    "        t1 = time.time()\n",
    "        res = func(*arg)\n",
    "        t2 = time.time()\n",
    "        # print ('%s took %0.3f ms' % (func, (t2-t1)*1000.0))\n",
    "        return [res, (t2 - t1) * 1000.0]\n",
    "\n",
    "    return wrapper\n",
    "\n",
    "\n",
    "# ===============================================================================\n",
    "# Method: expand\n",
    "#  Purpose: Returns the child nodes of the current node in a list\n",
    "#     Uses: os.listdir, which returns a Python list of children--directories\n",
    "#           as well as files.\n",
    "def expand(path):\n",
    "    return (os.listdir(path))\n",
    "\n",
    "# ===============================================================================\n",
    "# Method: breadthFirst\n",
    "#  Purpose: Conducts a Breadth-First search of the file structure\n",
    "#  Returns: The location of the file if it was found, an empty string otherwise.\n",
    "#     Uses: Wrapped by method_timing method\n",
    "@method_timing\n",
    "def breadthFirst(path, goal):\n",
    "    # TODO: Code breadth-first search\n",
    "    dq = deque([os.path.join(BASE_PATH, path)])\n",
    "    visited = []\n",
    "    while dq:\n",
    "        current_item = dq.pop()\n",
    "        if current_item not in visited:\n",
    "            for i in expand(current_item):\n",
    "                if i == goal:\n",
    "                    return current_item\n",
    "                if os.path.isdir(os.path.join(current_item, i)):\n",
    "                    dq.appendleft(os.path.join(current_item, i))\n",
    "            visited.append(current_item)\n",
    "    return \"\"\n",
    "\n",
    "# ===============================================================================\n",
    "# Method: depthFirst\n",
    "#  Purpose: Conducts a Depth-First search of the file structure\n",
    "#  Returns: The location of the file if it was found, an empty string otherwise.\n",
    "#     Uses: Wrapped by method_timing method\n",
    "@method_timing\n",
    "def depthFirst(path, goal):\n",
    "    dq = deque([os.path.join(BASE_PATH, path)])\n",
    "    visited = []\n",
    "    while dq:\n",
    "        current_item = dq.popleft()\n",
    "        if current_item not in visited:\n",
    "            for i in expand(current_item):\n",
    "                if i == goal:\n",
    "                    return current_item\n",
    "                if os.path.isdir(os.path.join(current_item, i)):\n",
    "                    dq.appendleft(os.path.join(current_item, i))\n",
    "            visited.append(current_item)\n",
    "    return \"\"\n",
    "\n",
    "\n",
    "# ===============================================================================\n",
    "# Method: serach\n",
    "#  Purpose: compbines the two searches with an option to which to use BFS OR DFS\n",
    "#  Returns: The location of the file if it was found, an empty string otherwise.\n",
    "#     Uses: Wrapped by method_timing method\n",
    "@method_timing\n",
    "def search(path, goal, search_type = 'BFS'):\n",
    "    dq = deque([os.path.join(BASE_PATH, path)])\n",
    "    visited = []\n",
    "    while dq:\n",
    "        current_item = dq.popleft() if (search_type.upper()=='BFS') else dq.pop()\n",
    "        if current_item not in visited:\n",
    "            for i in expand(current_item):\n",
    "                if i == goal:\n",
    "                    return current_item\n",
    "                if os.path.isdir(os.path.join(current_item, i)):\n",
    "                    dq.appendleft(os.path.join(current_item, i))\n",
    "            visited.append(current_item)\n",
    "    return \"\"\n",
    "# =====================\n",
    "# TODO: Main Algorithm\n",
    "#\n",
    "#  Completing the code above will allow this code to run. Comment or uncomment\n",
    "#   as necessary, but the final submission should be appear as the original.\n",
    "\n",
    "goal = \"YAjrbqc.bin\"\n",
    "# goal = \"xhtj8.bin\"\n",
    "# goal = \"XUB.bin\"\n",
    "\n",
    "bfs = numpy.empty((10))\n",
    "for x in range(0, 10):\n",
    "    filelocation = search(path, goal, 'BFS')\n",
    "    if filelocation[0] != \"\":\n",
    "        # print (\"BREADTH-FIRST: Found %s in %0.3f ms\" % (goal,filelocation[1]))\n",
    "        bfs[x] = filelocation[1]\n",
    "\n",
    "dfs = numpy.empty((10))\n",
    "for x in range(0, 10):\n",
    "    filelocation = search(path, goal, 'DFS')\n",
    "    if filelocation[0] != \"\":\n",
    "        # print (\"  DEPTH-FIRST: Found %s in %0.3f ms\" % (goal,filelocation[1]))\n",
    "        dfs[x] = filelocation[1]\n",
    "\n",
    "print(\"FULL PATH: %s\" % filelocation[0])\n",
    "print (\"BREADTH-FIRST SEARCH AVERAGE TIME: %0.3f ms\" % bfs.mean())\n",
    "print (\"DEPTH-FIRST SEARCH AVERAGE TIME: %0.3f ms\" % dfs.mean())"
   ]
  },
  {
   "cell_type": "code",
   "execution_count": 37,
   "metadata": {},
   "outputs": [],
   "source": [
    "import sys\n",
    "sys.executable\n",
    "import numpy"
   ]
  }
 ],
 "metadata": {
  "kernelspec": {
   "display_name": "Python 3",
   "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.7.0"
  }
 },
 "nbformat": 4,
 "nbformat_minor": 2
}