General Graph Directories
Acyclic graphs are usually right, but it’s expensive to check for cycles
Instead, many systems allow any kind of graph
- A is a subdirectory of B, and B is a subdirectory of A
Now, applications that traverse the tree have to be careful
Also, reference counting for deletion may not work