diff options
| author | Mike Bayer <mike_mp@zzzcomputing.com> | 2013-02-02 18:54:54 -0500 |
|---|---|---|
| committer | Mike Bayer <mike_mp@zzzcomputing.com> | 2013-02-02 18:54:54 -0500 |
| commit | d7e4a8529000ce2527861e13ed3f6e8660f35b8f (patch) | |
| tree | 03ca1fbe09b55106f7c34ae751dfb66de23dfcd4 /examples/graphs | |
| parent | db756a59112e3fb84721cce6bf03f9e386f3e103 (diff) | |
| download | sqlalchemy-d7e4a8529000ce2527861e13ed3f6e8660f35b8f.tar.gz | |
whack more long lines in very old docstrings
Diffstat (limited to 'examples/graphs')
| -rw-r--r-- | examples/graphs/__init__.py | 6 |
1 files changed, 4 insertions, 2 deletions
diff --git a/examples/graphs/__init__.py b/examples/graphs/__init__.py index 28a064bad..629808abe 100644 --- a/examples/graphs/__init__.py +++ b/examples/graphs/__init__.py @@ -1,5 +1,7 @@ -""" -An example of persistence for a directed graph structure. The graph is stored as a collection of edges, each referencing both a "lower" and an "upper" node in a table of nodes. Basic persistence and querying for lower- and upper- neighbors are illustrated:: +"""An example of persistence for a directed graph structure. The +graph is stored as a collection of edges, each referencing both a +"lower" and an "upper" node in a table of nodes. Basic persistence +and querying for lower- and upper- neighbors are illustrated:: n2 = Node(2) n5 = Node(5) |
