mirror of
https://github.com/sqlalchemy/sqlalchemy.git
synced 2026-05-10 02:39:59 -04:00
40f8aadd58
- added READMEs to all examples in each __init__.py and added to sphinx documentation - added versioning example - removed vertical/vertical.py, the dictlikes are more straightforward
9 lines
360 B
Python
9 lines
360 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()
|
|
|
|
""" |