Is there any functionality available with GoJS to achieve Breadth First Traversal, assuming that set of nodes, edges, start node and depth values are known.
Note: Can’t use TreeLayout.
There might be a sample that does that, but I don’t remember. However it’s very easy to implement such algorithms that are specific to the kinds of requirements that you may have in your graphs and according to the semantics of your app.