Package ghidra.graph.algo
Class IterativeFindPathsAlgorithm<V,E extends GEdge<V>>
java.lang.Object
ghidra.graph.algo.IterativeFindPathsAlgorithm<V,E>
- Type Parameters:
V
- the vertex typeE
- 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.
-
Constructor Summary
-
Method Summary
Modifier and TypeMethodDescriptionvoid
findPaths
(GDirectedGraph<V, E> g, V start, V end, Accumulator<List<V>> accumulator, TaskMonitor monitor) void
setStatusListener
(GraphAlgorithmStatusListener<V> listener)
-
Constructor Details
-
IterativeFindPathsAlgorithm
public IterativeFindPathsAlgorithm()
-
-
Method Details
-
setStatusListener
- Specified by:
setStatusListener
in interfaceFindPathsAlgorithm<V,
E extends GEdge<V>>
-
findPaths
public void findPaths(GDirectedGraph<V, E> g, V start, V end, Accumulator<List<V>> accumulator, TaskMonitor monitor) throws CancelledException- Specified by:
findPaths
in interfaceFindPathsAlgorithm<V,
E extends GEdge<V>> - Throws:
CancelledException
-