diff options
| author | Mike Bayer <mike_mp@zzzcomputing.com> | 2010-01-19 00:53:12 +0000 |
|---|---|---|
| committer | Mike Bayer <mike_mp@zzzcomputing.com> | 2010-01-19 00:53:12 +0000 |
| commit | 40f8aadd582776524d3b98da1f577c2fc95619e7 (patch) | |
| tree | 753eec3802734f397953976824a252bb60829189 /examples/graphs | |
| parent | 56fe538cc7d81ce264fc6504feb1ead5e17d0f55 (diff) | |
| download | sqlalchemy-40f8aadd582776524d3b98da1f577c2fc95619e7.tar.gz | |
- mega example cleanup
- 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
Diffstat (limited to 'examples/graphs')
| -rw-r--r-- | examples/graphs/__init__.py | 9 | ||||
| -rw-r--r-- | examples/graphs/directed_graph.py (renamed from examples/graphs/graph1.py) | 0 |
2 files changed, 9 insertions, 0 deletions
diff --git a/examples/graphs/__init__.py b/examples/graphs/__init__.py index e69de29bb..28a064bad 100644 --- a/examples/graphs/__init__.py +++ b/examples/graphs/__init__.py @@ -0,0 +1,9 @@ +""" +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() + +"""
\ No newline at end of file diff --git a/examples/graphs/graph1.py b/examples/graphs/directed_graph.py index 6122e65f1..6122e65f1 100644 --- a/examples/graphs/graph1.py +++ b/examples/graphs/directed_graph.py |