Ein Beispiel

3c42e73d · Prof. Dr. Robert Jäschke · 6be5e9f3 · 3c42e73d
Commit 3c42e73d authored 3 years ago by Prof. Dr. Robert Jäschke
--- a/Das_Haus_vom_Nikolaus.ipynb
+++ b/Das_Haus_vom_Nikolaus.ipynb
+{
+ "cells": [
+  {
+   "cell_type": "code",
+   "execution_count": null,
+   "metadata": {},
+   "outputs": [],
+   "source": [
+    "s = \"\"\"\n",
+    "  5\n",
+    " / \\\\\n",
+    "3---4\n",
+    "|\\ /|\n",
+    "| X |\n",
+    "|/ \\|\n",
+    "1---2\n",
+    "\"\"\"\n",
+    "\n",
+    "nikolaus = {\n",
+    "    1: [2, 3, 4],\n",
+    "    2: [1, 3, 4],\n",
+    "    3: [1, 2, 4, 5],\n",
+    "    4: [1, 2, 3, 5],\n",
+    "    5: [3, 4]\n",
+    "}\n",
+    "\n",
+    "\n",
+    "def get_neighbors(graph, path):\n",
+    "    neighbors = []\n",
+    "    for neighbor in graph[path[-1]]:\n",
+    "        if not contains(path[-1], neighbor, path):\n",
+    "            neighbors.append(neighbor)\n",
+    "    return neighbors\n",
+    "\n",
+    "\n",
+    "def contains(a, b, path):\n",
+    "    \"\"\"Returns True if path contains the sequence a, b or b, a.\"\"\"\n",
+    "    return any(path[pos:pos + 2] == [a, b] or path[pos:pos + 2] == [b, a] for pos in range(0, len(path) - 1))\n",
+    "\n",
+    "\n",
+    "def traverse(graph, path):\n",
+    "    neighbors = get_neighbors(graph, path)\n",
+    "    if len(neighbors) == 0:\n",
+    "        print(\"→\".join([str(n) for n in path]), end=' ')\n",
+    "        if len(path) == 9: # FIXME: constant!\n",
+    "            print(\":-)\")\n",
+    "        else:\n",
+    "            print(\":-(\")\n",
+    "    else:\n",
+    "        for neighbor in neighbors:\n",
+    "            traverse(graph, path + [neighbor])\n",
+    "\n",
+    "\n",
+    "if __name__ == '__main__':\n",
+    "    print(s)\n",
+    "    traverse(nikolaus, [1])"
+   ]
+  }
+ ],
+ "metadata": {
+  "language_info": {
+   "name": "python",
+   "pygments_lexer": "ipython3"
+  }
+ },
+ "nbformat": 4,
+ "nbformat_minor": 2
+}
+%% Cell type:code id: tags:
+
+``` 
+s = """
+  5
+ / \\
+3---4
+|\ /|
+| X |
+|/ \|
+1---2
+"""
+
+nikolaus = {
+    1: [2, 3, 4],
+    2: [1, 3, 4],
+    3: [1, 2, 4, 5],
+    4: [1, 2, 3, 5],
+    5: [3, 4]
+}
+
+
+def get_neighbors(graph, path):
+    neighbors = []
+    for neighbor in graph[path[-1]]:
+        if not contains(path[-1], neighbor, path):
+            neighbors.append(neighbor)
+    return neighbors
+
+
+def contains(a, b, path):
+    """Returns True if path contains the sequence a, b or b, a."""
+    return any(path[pos:pos + 2] == [a, b] or path[pos:pos + 2] == [b, a] for pos in range(0, len(path) - 1))
+
+
+def traverse(graph, path):
+    neighbors = get_neighbors(graph, path)
+    if len(neighbors) == 0:
+        print("→".join([str(n) for n in path]), end=' ')
+        if len(path) == 9: # FIXME: constant!
+            print(":-)")
+        else:
+            print(":-(")
+    else:
+        for neighbor in neighbors:
+            traverse(graph, path + [neighbor])
+
+
+if __name__ == '__main__':
+    print(s)
+    traverse(nikolaus, [1])
+```