Class RecursiveFindPathsAlgorithm<V,E extends GEdge<V>>

java.lang.Object
ghidra.graph.algo.RecursiveFindPathsAlgorithm<V,E>
Type Parameters:
V - the vertex type
E - the edge type
All Implemented Interfaces:
FindPathsAlgorithm<V,E>

public class RecursiveFindPathsAlgorithm<V,E extends GEdge<V>> extends Object implements FindPathsAlgorithm<V,E>
Finds all paths between two vertices for a given graph.

Warning: This is a recursive algorithm. As such, it is limited in how deep it can recurse. Any path that exceeds the JAVA_STACK_DEPTH_LIMIT will not be found.

Note: this algorithm is based entirely on the JohnsonCircuitsAlgorithm.