Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Small fixes to notebooks #59

Open
wants to merge 5 commits into
base: master
Choose a base branch
from
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion notebooks/appA.ipynb
Original file line number Diff line number Diff line change
Expand Up @@ -666,7 +666,7 @@
"cell_type": "markdown",
"metadata": {},
"source": [
"**Exercise:** Go back and run `run_timing_test` with a larger value of `max_time` and see if the run time converges to the line with slope 2. Just be careful not to make `max_time` to big."
"**Exercise:** Go back and run `run_timing_test` with a larger value of `max_time` and see if the run time converges to the line with slope 2. Just be careful not to make `max_time` too big."
]
},
{
Expand Down
8 changes: 4 additions & 4 deletions notebooks/chap02.ipynb
Original file line number Diff line number Diff line change
Expand Up @@ -156,7 +156,7 @@
"cell_type": "markdown",
"metadata": {},
"source": [
"We can use the keys in `pos` to add nodes to the graph."
"We can use the keys in `positions` to add nodes to the graph."
]
},
{
Expand Down Expand Up @@ -332,7 +332,7 @@
"cell_type": "markdown",
"metadata": {},
"source": [
"The `neighbors` method the neighbors for a given node."
"The `neighbors` method returns the neighbors for a given node."
]
},
{
Expand All @@ -348,7 +348,7 @@
"cell_type": "markdown",
"metadata": {},
"source": [
"**Exercise:** Make and draw complete directed graph with 5 nodes."
"**Exercise:** Make and draw a complete directed graph with 5 nodes."
]
},
{
Expand Down Expand Up @@ -789,7 +789,7 @@
"analysis, what is the order of growth for `is_connected`?\n",
"\n",
" def is_connected(G):\n",
" start = list(G)[0]\n",
" start = start = next(G.nodes_iter())\n",
" reachable = reachable_nodes(G, start)\n",
" return len(reachable) == len(G)"
]
Expand Down