9840936a4f
Previously, the depth was restricted because with BFS the amount of nodes we have in memory blows up exponentially. With DFS is is linear, so we can process trees of arbitrary depth. Signed-off-by: Evgenii Stratonikov <evgeniy@morphbits.ru> |
||
---|---|---|
.. | ||
accounting | ||
audit | ||
container | ||
control | ||
netmap | ||
notificator | ||
object | ||
object_manager | ||
policer | ||
replicator | ||
reputation | ||
session | ||
tree | ||
util |