topological sorting. of stuff.
Version bump.
import the wrapper class
add wrapper unittest based on stackoverflow example
bump version
We need to be able to generate an ordering for _any_ DAG, not just for a DAG with a given root.
Merge pull request #105 from stdweird/wrapper

Wrapper
Avoid generating the same node twice, once as the last entry of the children, once as the root during recursion.
Testing for a correct topological sorting of a DAG.
Example set of DAGs
Test for a fixed set of DAGs
Added a length property to test the topological sorting
add ConstantDict definition
add test utilities with EnhancedTestCase and use it in all tests, add tests for ConstantDict
fix remark
bump version
added a default option to show classname in log record
added testcase + made enabling classname more backwards compatible (only turn it on if fname in't turned off
Version bump
added the className format specifier