daviddoji/pytudes
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Update Maze.ipynb

Browse Source
This commit is contained in:
Emmet-Ray 2025-04-16 22:39:40 +08:00 committed by GitHub
parent 58326a0d84
commit 48fa5396e0
No known key found for this signature in database
GPG Key ID: B5690EEEBB952194
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
ipynb/Maze.ipynb
View File

@ -68,7 +68,7 @@
"I'll make the following implementation choices:\n",
"\n",
"- A tree will be represented as a set of edges.\n",
"- An `Edge` is a tuple of two nodes. Edges are bidirectional, so to avoid confusion we will always us the tuple that is in sorted order: always `(A, B)`, never `(B, A)`. The constructor `edge` enforces that.\n",
"- An `Edge` is a tuple of two nodes. Edges are bidirectional, so to avoid confusion we will always use the tuple that is in sorted order: always `(A, B)`, never `(B, A)`. The constructor `edge` enforces that.\n",
"- A node in a tree can be anything: a number, a letter, ... In this notebook we will make trees where the nodes are squares in a grid, but the function `random_tree` accepts nodes of any type.\n",
"- The algorithm for `random_tree(nodes, neighbors, pop)` works as follows:\n",
" * The arguments are:\n",