I am trying to see if there is an APOC procedure that will return all nodes reachable from a list of nodes and return only all the maximal paths from the input list. Currently, I am able to use the apoc.path.expand procedure to get all the paths from the input list of nodes. From this, I am post-processing and extracting only those maximal paths (paths that contain both the nodes and relationships of other paths and those that end at the same node). I am wondering if there can be a procedure that remembers this
maximal requirement while traversing the graph and returns only the maximal paths. Thanks.