Simplified challenge coding and unit tests by working with the node directly as opposed to node.id or node.data, which is more natural when writing coding challenges.

2026-01-07 18:08:01 +00:00 · 2015-08-05 06:14:44 -04:00
parent 1c5f34eb3e
commit b109b6f8cc
10 changed files with 52 additions and 13 deletions
--- a/graphs_trees/graph_bfs/bfs_solution.ipynb
+++ b/graphs_trees/graph_bfs/bfs_solution.ipynb
@@ -119,7 +119,7 @@
    "    root.visited = True\n",
    "    while queue:\n",
    "        node = queue.popleft()\n",
-    "        visit_func(node.id)\n",
+    "        visit_func(node)\n",
    "        for adjacent_node in node.adjacent:\n",
    "            if not adjacent_node.visited:\n",
    "                queue.append(adjacent_node)\n",