I am looking to find shortest path or all available paths between 2 vertices.
I have come across algos present in the documentation which will help find all possible paths
https://docs.tigergraph.com/graph-ml/current/pathfinding-algorithms/single-pair-all-paths
it says
This algorithm finds and prints all paths between two input vertices. This is similar to the all-paths functionality in the standard GraphStudio viewer, except that it supports output of all vertices in all paths to a file or to the console. If you are using GraphStudio and only want a fast visual display of all paths, use the GraphStudio implementation instead of this algorithm.
is there a way that I can get a version of GSQL which prints the output of the shortest path and all possible paths as a visulization.
https://docs.tigergraph.com/gui/current/graphstudio/explore-graph/find-paths-between-vertices#_find_paths_between_two_vertices
to add on would like to know if I can get this version of code in gsql for my usecase