Since all models in ADOxx could be intepreted as graphs, graph-based algorithms can be applied. Please find attached the implementation of 2 algorithms that build on a search approach to find all potential paths in a model and return them as a list. The second algorithm builds upon that implementation and adds the functionality to go through all nodes to find the possible paths from this element to the end of the graph. The algorithms dynamically identify the start object (as the object without incoming relations) and end object (as the object without outgoing relations) and als subgraphs are supported.
Attached to this post, the ABL file, implementing the AdoScript can be found. In order to adapt to your needs, have a look at the attached AdoScript file and modify the mapping section at the beginning. The functionality is provided through menu items added to ADOxx.
www.adoxx.org
