diff options
| author | Furkan Onder <furkanonder@protonmail.com> | 2023-02-14 10:20:11 (GMT) |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2023-02-14 10:20:11 (GMT) |
| commit | 3690688149dca11589af59b7704541336613199a (patch) | |
| tree | 3a775ed8bb3981936540b8fb352a5f6c120a0375 /Doc/library/graphlib.rst | |
| parent | e5da9ab2c82c6b4e4f8ffa699a9a609ea1bea255 (diff) | |
| download | cpython-3690688149dca11589af59b7704541336613199a.zip cpython-3690688149dca11589af59b7704541336613199a.tar.gz cpython-3690688149dca11589af59b7704541336613199a.tar.bz2 | |
GH-101898: Fix missing term references for hashable definition (#101899)
Fix missing term references for hashable definition
Diffstat (limited to 'Doc/library/graphlib.rst')
| -rw-r--r-- | Doc/library/graphlib.rst | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/Doc/library/graphlib.rst b/Doc/library/graphlib.rst index 2bc80da..fe7932e 100644 --- a/Doc/library/graphlib.rst +++ b/Doc/library/graphlib.rst @@ -17,7 +17,7 @@ .. class:: TopologicalSorter(graph=None) - Provides functionality to topologically sort a graph of hashable nodes. + Provides functionality to topologically sort a graph of :term:`hashable` nodes. A topological order is a linear ordering of the vertices in a graph such that for every directed edge u -> v from vertex u to vertex v, vertex u comes @@ -85,7 +85,7 @@ .. method:: add(node, *predecessors) Add a new node and its predecessors to the graph. Both the *node* and all - elements in *predecessors* must be hashable. + elements in *predecessors* must be :term:`hashable`. If called multiple times with the same node argument, the set of dependencies will be the union of all dependencies passed in. |