Implement iterators
Hywan opened this issue · 0 comments
Hywan commented
This is crucial to be able to iterate over nodes in different ways starting from a specific node.
Here are the basic algorithms:
- Depth-First Search (DFS),
- Breadth-First Search (BFS).
And the backward versions would be welcomed too (necessary for Hoa\Acl
):
- Backward Depth-First Search (BDFS),
- Backward Breadth-First Search (BBFS).