Namespaces

Classes

CommitOrderCalculator implements topological sorting, which is an ordering algorithm for directed graphs (DG) and/or directed acyclic graphs (DAG) by using a depth-first searching (DFS) to traverse the graph built in memory.
Class, which can handle completion of hydration cycle and produce some of tasks.