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

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

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

Note: this algorithm is based on the JohnsonCircuitsAlgorithm, modified to be iterative instead of recursive.