dfs is:module

Depth-first search algorithms. Names consist of:

1. An optional direction parameter, specifying which nodes to visit next.

• u undirectional: ignore edge direction
• r reversed: walk edges in reverse
• x user defined: speciy which paths to follow

1. "df" for depth-first
2. A structure parameter, specifying the type of the result.
   • s Flat list of results
   • f Structured Tree of results
3. An optional "With", which instead of putting the found nodes directly into the result, adds the result of a computation on them into it.
4. An optional prime character, in which case all nodes of the graph will be visited, instead of a user-given subset.

MongoDB GridFS implementation