Uses algorithm borrowed from networkx graph library to sort a graph in topological order. The method is only used by output plugins, as internal plumbery does not really care about the node order. Also includes a bonobo.util.python.require function that helps importing thing in a package-less context, or when there are conflict with site package names.
7 lines
132 B
Python
7 lines
132 B
Python
from bonobo.util.python import require
|
|
|
|
|
|
def test_require():
|
|
dummy = require('requireable.dummy')
|
|
assert dummy.foo == 'bar'
|