codespell: pre-commit, config, typos fixed (#6662)

* One ambigous typo

* one more ambigous typo

* [DATALAD RUNCMD] run codespell throughout

=== Do not change lines below ===
{
 "chain": [],
 "cmd": "codespell -w",
 "exit": 0,
 "extra_inputs": [],
 "inputs": [],
 "outputs": [],
 "pwd": "."
}
^^^ Do not change lines above ^^^

For this to work -- it would require configuration files which were abandoned.
See https://github.com/networkx/networkx/pull/6662 for more discussion etc.

* Manual reversion of perform... "fix"

14 files changed, 31 insertions, 31 deletions

diff --git a/doc/developer/projects.rst b/doc/developer/projects.rst
index eafae920..b24f5935 100644
--- a/doc/developer/projects.rst
+++ b/doc/developer/projects.rst
@@ -48,7 +48,7 @@ Visualization API with Matplotlib
   are trying to add new features especially with regard to plotting edges. We'd like
   someone to read a lot about what we offer and also what Matplotlib offers, and
   come up with a nice way for users to draw graphs flexibly and yet with good defaults.
-  There is little chace just a broad topic could be completed in one summer, but a
+  There is little chance just a broad topic could be completed in one summer, but a
   roadmap and substantial headway on that road is possible.
 
 - Recommended Skills: Python, matplotlib experience.
diff --git a/doc/release/api_1.11.rst b/doc/release/api_1.11.rst
index 73269c7e..91184381 100644
--- a/doc/release/api_1.11.rst
+++ b/doc/release/api_1.11.rst
@@ -23,7 +23,7 @@ API changes
 
 * [`#1750 <https://github.com/networkx/networkx/pull/1750>`_]
   Arguments center and scale are now available for all layout functions.
-  The defaul values revert to the v1.9 values (center is the origin
+  The default values revert to the v1.9 values (center is the origin
   for circular layouts and domain is [0, scale) for others.
 
 * [`#1924 <https://github.com/networkx/networkx/pull/1924>`_]
diff --git a/doc/release/migration_guide_from_2.x_to_3.0.rst b/doc/release/migration_guide_from_2.x_to_3.0.rst
index 8035f4d3..8fa9c1a1 100644
--- a/doc/release/migration_guide_from_2.x_to_3.0.rst
+++ b/doc/release/migration_guide_from_2.x_to_3.0.rst
@@ -29,7 +29,7 @@ However, NetworkX 3.0 includes many changes and improvements centered around
 tighter integration with other scientific Python libraries; namely
 ``numpy``, ``scipy``, ``matplotlib``, and ``pandas``.
 
-There are no dependencies for NetworkX's core funtionality, such as the data
+There are no dependencies for NetworkX's core functionality, such as the data
 structures (``Graph``, ``DiGraph``, etc.) and common algorithms, but some
 functionality, e.g. functions found in the ``networkx.linalg`` package, are
 only available if these additional libraries are installed.
diff --git a/doc/release/release_2.0.rst b/doc/release/release_2.0.rst
index 8f27a91a..baa8ef68 100644
--- a/doc/release/release_2.0.rst
+++ b/doc/release/release_2.0.rst
@@ -427,7 +427,7 @@ Merged PRs
 - Fix code escaping. (#2214)
 - Add adjlist_outer_dict_factory. (#2222)
 - Typo in scale free network generator documentation (#2225)
-- Add link to nx.drawing.layout instead of mentionning nx.layout. (#2224)
+- Add link to nx.drawing.layout instead of mentioning nx.layout. (#2224)
 - Example not working in tutorial (#2230)
 - don't assume nodes are sortable when running dag_longest_path (#2228)
 - Correct typo (#2236)
@@ -456,7 +456,7 @@ Merged PRs
 - Adds chain decomposition algorithm. (#2284)
 - add the Hoffman-Singleton graph (#2275)
 - Allow grid_graph generator to accept tuple dim argument (#2320)
-- psuedo -> pseudo (fixing typo) (#2322)
+- pseudo -> pseudo (fixing typo) (#2322)
 - Corrects navigable small world graph param docs (#2321)
 - Fix bug in find_cycle. (#2324)
 - flip source target (#2309)
diff --git a/doc/release/release_2.2.rst b/doc/release/release_2.2.rst
index 82b2651b..79f7fee8 100644
--- a/doc/release/release_2.2.rst
+++ b/doc/release/release_2.2.rst
@@ -38,7 +38,7 @@ default RNG. You can also create your own RNG and pass it into the `seed`
 argument. Finally, you can use an integer to indicate the state to set for
 the RNG. In this case a local RNG is created leaving the global RNG untouched.
 Some functions use `random` and some use `numpy.random`, but we have written
-a translater so that all functions CAN take a `numpy.random.RandomState`
+a translator so that all functions CAN take a `numpy.random.RandomState`
 object. So a single RNG can be used for the entire package.
 
 Cyclic references between graph classes and views have been removed to ease
@@ -91,7 +91,7 @@ H.update(e), and H.update(nodes=n) are also allowed.
 First argument is a graph if it has `edges` and `nodes` attributes.
 Otherwise the first argument is treated as a list of edges.
 
-The bellman_ford predecessor dicts had sentinal value `[None]` for
+The bellman_ford predecessor dicts had sentinel value `[None]` for
 source nodes. That has been changed so source nodes have pred value '[]'
 
 
diff --git a/doc/release/release_2.4.rst b/doc/release/release_2.4.rst
index 8fee1029..6610ab4f 100644
--- a/doc/release/release_2.4.rst
+++ b/doc/release/release_2.4.rst
@@ -144,7 +144,7 @@ A total of 205 changes have been committed.
 - Add doc warning about self-loops for adamic_adar_index (#3427)
 - Fix UnionFind set extraction (#3224)
 - add required argument to `write_graphml` example (#3429)
-- Fix centrality betweeness subset (#3425)
+- Fix centrality betweenness subset (#3425)
 - Add two versions of Simrank similarity (#3222)
 - Fixed typo
 - Merge pull request #3436 from nandahkrishna/fix-typo-betweenness-centrality-subset-test
@@ -275,7 +275,7 @@ A total of 205 changes have been committed.
 - Remove unused imports
 - Fix some warnings
 - Update testing instructions
-- Reenable all test platforms
+- Re-enable all test platforms
 - Fix some __init__ warnings
 - replace nose yield tests in test_coloring.py
 - Add testing, coverage, and dev environment info
@@ -295,7 +295,7 @@ A total of 205 changes have been committed.
 - tracking down use of deprecated functions
 - Fix deprecated use of add_path/star/cycle
 - reduce warnings for deprecated functions
-- skirt issues wih raises in test_harmonic
+- skirt issues with raises in test_harmonic
 - reduce the number of warnings by removing deprecated functions
 - convert_matrix demo of one way to get doctests to work
 - Remove deprecated from examples
diff --git a/doc/release/release_2.5.rst b/doc/release/release_2.5.rst
index 36331528..066999e0 100644
--- a/doc/release/release_2.5.rst
+++ b/doc/release/release_2.5.rst
@@ -67,7 +67,7 @@ Improvements
 - scale arrows better when drawing
 - more uniform creation of random lobster graphs
 - allow editing graph during iteration over connected_components
-- better column handling in coversion of pandas DataFrame
+- better column handling in conversion of pandas DataFrame
 - allow simrank_similarity with directed graph input
 - ensure VoteRank ability is nonnegative
 - speedup kernighan_lin_bisection
@@ -260,7 +260,7 @@ A total of 256 changes have been committed.
 - Fix: documentation of simrank_similarity_numpy (#3954)
 - Fix for #3930 (source & target columns not overwritten when converting to pd.DataFrame) (#3935)
 - Add weight function for shortest simple paths for #3948 (#3949)
-- Fix defination of communicability (#3973)
+- Fix definition of communicability (#3973)
 - Fix simrank_similarity with directed graph input (#3961)
 - Fixed weakening of voting ability (#3970)
 - implemented faster sweep algorithm for kernighan_lin_bisection (#3858)
@@ -356,7 +356,7 @@ A total of 256 changes have been committed.
 - Add team gallery (#4117)
 - CI: Setup circle CI for documentation builds (#4119)
 - Build pdf (#4123)
-- DOC: Suggestions and improvments from tutorial readthrough (#4121)
+- DOC: Suggestions and improvements from tutorial readthrough (#4121)
 - Enable 3.9-dev on travis (#4124)
 - Fix parse_edgelist behavior with multiple attributes (#4125)
 - CI: temporary fix for CI latex installation issues (#4131)
diff --git a/doc/release/release_2.6.rst b/doc/release/release_2.6.rst
index bc2067f3..2dedfab3 100644
--- a/doc/release/release_2.6.rst
+++ b/doc/release/release_2.6.rst
@@ -316,7 +316,7 @@ Merged PRs
 - Update Knuth miles example. (#4251)
 - Update "four_grids" gallery example (#4264)
 - Improve legibility of labels in plot_labels_and_colors example (#4266)
-- Improve readibility of chess_example in gallery (#4252)
+- Improve readability of chess_example in gallery (#4252)
 - Fix contracted_edge for multiple edges (#4274)
 - Add seeds to gallery examples for reproducibility (#4276)
 - Add a 3D plotting example with matplotlib to the gallery (#4268)
@@ -329,7 +329,7 @@ Merged PRs
 - Deprecate nx_yaml (#4281)
 - Deprecate gpickle (#4282)
 - Improve relabel coverage, tweak docstrings (#4299)
-- Swith to travis-ci.com
+- Switch to travis-ci.com
 - TST: Increase test coverage of convert_matrix (#4301)
 - Add descriptive error message for Node/EdgeView slicing. NEXP2 (#4300)
 - Don't import other people's version.py (#4289)
@@ -384,7 +384,7 @@ Merged PRs
 - Update docstring for to_pandas_edgelist and add edgekey parameter (#4384)
 - TST: Boost test coverage of nx_pylab module (#4375)
 - Fixed issue where edge attributes were being silently overwritten during node contraction (#4273)
-- CI: Fix CircleCI doc buiild failure (#4388)
+- CI: Fix CircleCI doc build failure (#4388)
 - Improve test coverage of convert module (#4306)
 - Add gene-gene network (#4269)
 - Ignore expected warnings (#4391)
@@ -439,7 +439,7 @@ Merged PRs
 - Handle self-loops for single self-loop (drawing) (#4425)
 - Update GH actions links in README (#4482)
 - Improve code coverage for cuts.py (#4473)
-- Reenable tests (#4488)
+- Re-enable tests (#4488)
 - Update Sphinx (#4494)
 - Update pre-commit (#4495)
 - Simplify example dependencies (#4506)
@@ -603,7 +603,7 @@ Merged PRs
 - Remove decorator dependency (#4739)
 - Update docstrings for dfs and bfs edges and fix cross links (#4900)
 - Fix graph_class usage in to_undirected method (#4912)
-- Fix assortativity coefficent calculation (#4851)
+- Fix assortativity coefficient calculation (#4851)
 - Deprecate numeric_mixing_matrix. (#4923)
 - Update read_gml docstring with destringizer ex (#4916)
 - Update release process (#4866)
diff --git a/doc/release/release_2.7.rst b/doc/release/release_2.7.rst
index c7a9a423..661bcfba 100644
--- a/doc/release/release_2.7.rst
+++ b/doc/release/release_2.7.rst
@@ -101,7 +101,7 @@ Improvements
   Improve the validation and performance of ``nx.is_matching``,
   ``nx.is_maximal_matching`` and ``nx.is_perfect_matcing``.
 - [`#4924 <https://github.com/networkx/networkx/pull/4924>`_]
-  Fix handling of disconnected graphs whne computing
+  Fix handling of disconnected graphs when computing
   ``nx.common_neighbor_centrality``.
 - [`#4929 <https://github.com/networkx/networkx/pull/4929>`_]
   Add Louvain community detection.
@@ -156,7 +156,7 @@ Improvements
 - [`#5139 <https://github.com/networkx/networkx/pull/5139>`_]
   Add support for the `scipy.sparse` array interface.
 - [`#5144 <https://github.com/networkx/networkx/pull/5144>`_]
-  Improve readibility of ``node_classification`` functions.
+  Improve readability of ``node_classification`` functions.
 - [`#5145 <https://github.com/networkx/networkx/pull/5145>`_]
   Adopt `math.hypot` which was added in Python 3.8.
 - [`#5153 <https://github.com/networkx/networkx/pull/5153>`_]
@@ -263,7 +263,7 @@ A total of 166 changes have been committed.
 - Change exception varname e to err (#5130)
 - minor tweaks in assortativity docs and code (#5129)
 - Allow edge style to be a list of styles for DiGraphs (#5131)
-- Add examples and minor documentaion refactor for operators/binary.py (#5099)
+- Add examples and minor documentation refactor for operators/binary.py (#5099)
 - Improve random graphs test suite for gnp generators (issue #5092) (#5115)
 - Add note about checking for path existence to all_simple_paths. (#5059)
 - Fix message of raised exception in decorators. (#5136)
diff --git a/doc/release/release_2.8.1.rst b/doc/release/release_2.8.1.rst
index 9d09af1a..1182c6ca 100644
--- a/doc/release/release_2.8.1.rst
+++ b/doc/release/release_2.8.1.rst
@@ -88,7 +88,7 @@ A total of 52 changes have been committed.
 - Disallow isolated nodes for Eulerian Path (#5616)
 - Fix triadic census (#5575)
 - Adjust the usage of nodes_or_number decorator (#5599)
-- Use new ubunut LTS release (#5630)
+- Use new ubuntu LTS release (#5630)
 - Build docs with Py 3.9 (#5632)
 - added example on moral graph (#5633)
 - Added examples in weakly_connected.py (#5593)
@@ -99,7 +99,7 @@ A total of 52 changes have been committed.
 - Added example under unary operators (#5625)
 - Added docstring examples to matching functions (#5617)
 - doc: fix typos in docstring and comment (#5647)
-- DOC: remove note re: non-existant param (#5648)
+- DOC: remove note re: non-existent param (#5648)
 - added examples to covering.py (#5646)
 - added examples on chain decomposition (#5641)
 - Fix typo (#5652)
diff --git a/doc/release/release_3.0.rst b/doc/release/release_3.0.rst
index 46944121..a09daa7c 100644
--- a/doc/release/release_3.0.rst
+++ b/doc/release/release_3.0.rst
@@ -163,7 +163,7 @@ Merged PRs
 - added examples to regular.py (#5642)
 - added examples to degree_alg.py (#5644)
 - Add docstring examples for triads functions (#5522)
-- Fix docbuild warnings: is_string_like is removed and identation in corona product (#5845)
+- Fix docbuild warnings: is_string_like is removed and indentation in corona product (#5845)
 - Use py_random_state to control randomness of random_triad (#5847)
 - Remove OrderedGraphs (#5813)
 - Drop NumPy 1.19 (#5856)
@@ -245,7 +245,7 @@ Merged PRs
 - Hide edges with a weight of None in A*. (#5945)
 - Add dfs_labeled_edges reporting of reverse edges due to depth_limit. (#6240)
 - Warn users about duplicate nodes in generator function input (#6237)
-- Reenable geospatial examples (#6252)
+- Re-enable geospatial examples (#6252)
 - Draft 3.0 release notes (#6232)
 - Add 2.8.x release notes (#6255)
 - doc: clarify allowed `alpha` when using nx.draw_networkx_edges (#6254)
diff --git a/doc/release/release_3.1.rst b/doc/release/release_3.1.rst
index ea788ae2..a998cf78 100644
--- a/doc/release/release_3.1.rst
+++ b/doc/release/release_3.1.rst
@@ -57,7 +57,7 @@ Merged PRs
 - Fix link in isomorphvf2.py (#6347)
 - Add dev release notes template
 - Update precommit hooks (#6348)
-- Add clique examples and deprecate helper funtions (#6186)
+- Add clique examples and deprecate helper functions (#6186)
 - Laplace centrality for issue 4973 (#5399)
 - doc:improve doc of possible values of nodes and expected behaviour (#6333)
 - add OrderedGraph removal as an API change in release_3.0.rst (#6354)
@@ -70,7 +70,7 @@ Merged PRs
 - provide tikz with degrees, not radians (#6360)
 - Improve handling of create_using to allow Mixins of type Protocol (#6244)
 - Remove an instance of random.sample from a set (deprecated in Python 3.9) (#6380)
-- DOC: Add banner for user survey annoucement (#6375)
+- DOC: Add banner for user survey announcement (#6375)
 - bump pre-commit hooks (and fix CI) (#6396)
 - Add generate / write "network text" (formerly graph_str) (#5602)
 - Improve doc regular graphs (#6397)
diff --git a/networkx/algorithms/approximation/matching.py b/networkx/algorithms/approximation/matching.py
index 17a52eda..6a60b11b 100644
--- a/networkx/algorithms/approximation/matching.py
+++ b/networkx/algorithms/approximation/matching.py
@@ -31,7 +31,7 @@ def min_maximal_matching(G):
 
     Notes
     -----
-    The algorithm computes an approximate solution fo the minimum maximal
+    The algorithm computes an approximate solution for the minimum maximal
     cardinality matching problem. The solution is no more than 2 * OPT in size.
     Runtime is $O(|E|)$.
 
diff --git a/networkx/algorithms/isomorphism/tree_isomorphism.py b/networkx/algorithms/isomorphism/tree_isomorphism.py
index 372224ca..1ff9f004 100644
--- a/networkx/algorithms/isomorphism/tree_isomorphism.py
+++ b/networkx/algorithms/isomorphism/tree_isomorphism.py
@@ -269,11 +269,11 @@ def tree_isomorphism(t1, t2):
 
     # If there both have 2 centers,  then try the first for t1
     # with the first for t2.
-    attemps = rooted_tree_isomorphism(t1, center1[0], t2, center2[0])
+    attempts = rooted_tree_isomorphism(t1, center1[0], t2, center2[0])
 
     # If that worked we're done.
-    if len(attemps) > 0:
-        return attemps
+    if len(attempts) > 0:
+        return attempts
 
     # Otherwise, try center1[0] with the center2[1], and see if that works
     return rooted_tree_isomorphism(t1, center1[0], t2, center2[1])