summaryrefslogtreecommitdiff
path: root/examples/graphs/directed_graph.py
diff options
context:
space:
mode:
authorMike Bayer <mike_mp@zzzcomputing.com>2011-01-02 14:23:42 -0500
committerMike Bayer <mike_mp@zzzcomputing.com>2011-01-02 14:23:42 -0500
commit350aed3fdb9f1e73e69655e53f44ca6a91c196da (patch)
tree3d2a128667b5f6ca6d0b4e1f4865fc98aac6b60b /examples/graphs/directed_graph.py
parent71f92436bdc86f30e2c21d8f5244733601e8c39e (diff)
downloadsqlalchemy-350aed3fdb9f1e73e69655e53f44ca6a91c196da.tar.gz
- whitespace removal bonanza
Diffstat (limited to 'examples/graphs/directed_graph.py')
-rw-r--r--examples/graphs/directed_graph.py14
1 files changed, 7 insertions, 7 deletions
diff --git a/examples/graphs/directed_graph.py b/examples/graphs/directed_graph.py
index 6052c68bc..3ba602f00 100644
--- a/examples/graphs/directed_graph.py
+++ b/examples/graphs/directed_graph.py
@@ -9,20 +9,20 @@ Base = declarative_base()
class Node(Base):
__tablename__ = 'node'
-
+
node_id = Column(Integer, primary_key=True)
def __init__(self, id):
self.node_id = id
-
+
def add_neighbors(self, *nodes):
for node in nodes:
Edge(self, node)
return self
-
+
def higher_neighbors(self):
return [x.higher_node for x in self.lower_edges]
-
+
def lower_neighbors(self):
return [x.lower_node for x in self.higher_edges]
@@ -32,7 +32,7 @@ class Edge(Base):
lower_id = Column(Integer,
ForeignKey('node.node_id'),
primary_key=True)
-
+
higher_id = Column(Integer,
ForeignKey('node.node_id'),
primary_key=True)
@@ -43,7 +43,7 @@ class Edge(Base):
higher_node = relationship(Node,
primaryjoin=higher_id==Node.node_id,
backref='higher_edges')
-
+
# here we have lower.node_id <= higher.node_id
def __init__(self, n1, n2):
if n1.node_id < n2.node_id:
@@ -62,7 +62,7 @@ session = sessionmaker(engine)()
# n1 -> n2 -> n5
# -> n7
# -> n3 -> n6
-
+
n1 = Node(1)
n2 = Node(2)
n3 = Node(3)