Given the root node or a Vertex ID. How to traverse through the graph, listing all of its vertices and edges till it’s depth. (Here my graph is actually a kind of tree structure).
PS : I am not looking for a shortest path or all path traversal. I am just given a source vertex ID and want to list down all the vertices and edges till depth of the tree.
You can perform the traversal and list vertices and edges up to a certain depth using graph traversal algorithms like Breadth-First Search (BFS) or Depth-First Search (DFS). these algorithms are available in Tigergraph Github.I Hope this will Help you
1 Like
@pushpakmittal For more information on available algorithms you can check out the Graph Data Science Library 
TigerGraph Graph Data Science Library :: TigerGraph Graph Data Science Library
1 Like