Given a source vertex, a list of “acceptable edges” and max_depth. I would like to find all the paths from source to max depth and return only the paths/edges such that the path must have at least one edge that is present in acceptable edges list.
I could not find any dfs algo in: GitHub - tigergraph/gsql-graph-algorithms: GSQL Graph Algorithms
how can I do this?