def sorted(self):
dag = DAG()
imap = dict()
vmap = dict()
for _ in self.interceptors:
k = self.key(_.interceptor)
imap[k] = _
vmap[k] = dag.add(k)
for k in imap:
_ = imap[k]
v = vmap[k]
if _.before:
for o in _.before:
o = vmap[self.key(o)]
dag.add_edge(v, o)
if _.after:
for o in _.after:
o = vmap[self.key(o)]
dag.add_edge(o, v)
rs = dag.topologicaly()
s = [imap[k].interceptor for k in rs]
return s
def sorted(self):
dag = DAG()
imap = dict()
vmap = dict()
for _ in self.interceptors:
k = self.key(_.interceptor)
imap[k] = _
vmap[k] = dag.add(k)
for k in imap:
_ = imap[k]
v = vmap[k]
if _.before:
for o in _.before:
o = vmap[self.key(o)]
dag.add_edge(v, o)
if _.after:
for o in _.after:
o = vmap[self.key(o)]
dag.add_edge(o, v)
rs = dag.topologicaly()
s = [imap[k].interceptor for k in rs]
return s
def test_simple(self):
'''
Tests the verticles order in:
C --> A --> B --> D
'''
dag = DAG()
a = dag.add("A")
b = dag.add("B")
c = dag.add("C")
d = dag.add("D")
dag.add_edge(c, a)
dag.add_edge(a, b)
dag.add_edge(b, d)
dag.add_edge(c, d)
rs = dag.topologicaly()
self.assertTrue(rs.index("C") < rs.index("A"))
self.assertTrue(rs.index("A") < rs.index("B"))
self.assertTrue(rs.index("B") < rs.index("D"))
self.assertTrue(rs.index("C") < rs.index("D"))
def test_simple(self):
'''
Tests the verticles order in:
C --> A --> B --> D
'''
dag = DAG()
a = dag.add("A")
b = dag.add("B")
c = dag.add("C")
d = dag.add("D")
dag.add_edge(c, a)
dag.add_edge(a, b)
dag.add_edge(b, d)
dag.add_edge(c, d)
rs = dag.topologicaly()
self.assertTrue(rs.index("C") < rs.index("A"))
self.assertTrue(rs.index("A") < rs.index("B"))
self.assertTrue(rs.index("B") < rs.index("D"))
self.assertTrue(rs.index("C") < rs.index("D"))
'''
Created on Oct 3, 2012
@author: Moises P. Sena
'''
from sdag2 import DAG
dag = DAG()
a = dag.add("A")
b = dag.add("B")
c = dag.add("C")
d = dag.add("D")
dag.add_edge(c, a)
dag.add_edge(a, b)
dag.add_edge(b, d)
dag.add_edge(c, d)
rs = dag.topologicaly()
# Order is: C --> A --> B --> D
print("Order is: %s" % (" --> ".join(rs)))
assert rs.index("C") < rs.index("A")
assert rs.index("A") < rs.index("B")
assert rs.index("B") < rs.index("D")
assert rs.index("C") < rs.index("D")
i = 0
while line:
line = line.strip()
i += 1
if not line:
stderr.write("[WARN]: Line %s is empty.\n" % i)
continue
elif line == options.quit_sequence:
break
parts = split(options.separator, line)
try:
if len(parts) == 2:
dag.add_edge(parts[0], parts[1])
elif len(parts) == 1:
dag.add(parts[0])
else:
stderr.write("[ERROR]: Line %s contains more 2 items.\n" % i)
exit(1)
line = inf.readline()
except CycleDetectedException as ex:
stderr.write("[ERROR]: %s.\n" % ex)
exit(1)
for l in dag.topologicaly(gen=True):
outf.write(l)
outf.write("\n")
i = 0
while line:
line = line.strip()
i += 1
if not line:
stderr.write("[WARN]: Line %s is empty.\n" % i)
continue
elif line == options.quit_sequence:
break
parts = split(options.separator, line)
try:
if len(parts) == 2:
dag.add_edge(parts[0], parts[1])
elif len(parts) == 1:
dag.add(parts[0])
else:
stderr.write("[ERROR]: Line %s contains more 2 items.\n" % i)
exit(1)
line = inf.readline()
except CycleDetectedException as ex:
stderr.write("[ERROR]: %s.\n" % ex)
exit(1)
for l in dag.topologicaly(gen=True):
outf.write(l)
outf.write("\n")
"""
Created on Oct 3, 2012
@author: Moises P. Sena
"""
from sdag2 import DAG
dag = DAG()
a = dag.add("A")
b = dag.add("B")
c = dag.add("C")
d = dag.add("D")
dag.add_edge(c, a)
dag.add_edge(a, b)
dag.add_edge(b, d)
dag.add_edge(c, d)
rs = dag.topologicaly()
# Order is: C --> A --> B --> D
print("Order is: %s" % (" --> ".join(rs)))
assert rs.index("C") < rs.index("A")
assert rs.index("A") < rs.index("B")
assert rs.index("B") < rs.index("D")
assert rs.index("C") < rs.index("D")
