Package ghidra.graph.algo

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

java.lang.Object

ghidra.graph.algo.FindPathsAlgorithm<V,E>

Type Parameters:

V - the vertex type

E - the edge type

public class FindPathsAlgorithm<V,E extends GEdge<V>>
extends java.lang.Object

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.

Field Summary

Fields

Modifier and Type	Field	Description
static int	JAVA_STACK_DEPTH_LIMIT

Constructor Summary

Constructors

Constructor	Description
FindPathsAlgorithm(GDirectedGraph<V,E> g, V start, V end, Accumulator<java.util.List<V>> accumulator, TaskMonitor monitor)

Method Summary

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Field Detail

JAVA_STACK_DEPTH_LIMIT

public static final int JAVA_STACK_DEPTH_LIMIT

See Also:

Constant Field Values

Constructor Detail

FindPathsAlgorithm

public FindPathsAlgorithm(GDirectedGraph<V,E> g,
                          V start,
                          V end,
                          Accumulator<java.util.List<V>> accumulator,
                          TaskMonitor monitor)
                   throws CancelledException

Throws:

CancelledException