mirror of
https://github.com/sqlalchemy/sqlalchemy.git
synced 2026-05-06 17:01:07 -04:00
Albert Tugushev
a836e3df5d
<!-- Provide a general summary of your proposed changes in the Title field above -->
### Description
<!-- Describe your changes in detail -->
Remove print statements
### Checklist
<!-- go over following points. check them with an `x` if they do apply, (they turn into clickable checkboxes once the PR is submitted, so no need to do everything at once)
-->
This pull request is:
- [X] A documentation / typographical error fix
- Good to go, no issue or tests are needed
- [ ] A short code fix
- please include the issue number, and create an issue if none exists, which
must include a complete example of the issue. one line code fixes without an
issue and demonstration will not be accepted.
- Please include: `Fixes: #<issue number>` in the commit message
- please include tests. one line code fixes without tests will not be accepted.
- [ ] A new feature implementation
- please include the issue number, and create an issue if none exists, which must
include a complete example of how the feature would look.
- Please include: `Fixes: #<issue number>` in the commit message
- please include tests.
**Have a nice day!**
Closes: #5166
Pull-request: https://github.com/sqlalchemy/sqlalchemy/pull/5166
Pull-request-sha: 04a7394f71
Change-Id: Ib90a59fac929661a18748c6e44966fb87e3978c6
14 lines
378 B
Python
14 lines
378 B
Python
"""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)
|
|
n2.add_neighbor(n5)
|
|
print(n2.higher_neighbors())
|
|
|
|
.. autosource::
|
|
|
|
"""
|