Package ghidra.graph.algo

package ghidra.graph.algo

Related Packages

Package	Description
ghidra.graph

Class	Description
ChkDominanceAlgorithm<V, E extends GEdge<V>>	This algorithm is an implementation of the Cooper, Harvey, Kennedy algorithm.
ChkPostDominanceAlgorithm<V, E extends GEdge<V>>	This is ChkDominanceAlgorithm with reverse graph traversal, which allows the algorithm to calculate post dominance.
DepthFirstSorter<V, E extends GEdge<V>>	Processes the given graph depth first and records that order of the vertices.
DijkstraShortestPathsAlgorithm<V, E extends GEdge<V>>	Dijkstra's shortest-path algorithm
FindPathsAlgorithm<V, E extends GEdge<V>>
GraphAlgorithmStatusListener<V>	An interface and state values used to follow the state of vertices as they are processed by algorithms
GraphAlgorithmStatusListener.STATUS
GraphNavigator<V, E extends GEdge<V>>	The methods on this interface are meant to enable graph traversal in a way that allows the underlying graph to be walked from top-down or bottom-up.
IterativeFindPathsAlgorithm<V, E extends GEdge<V>>	Finds all paths between two vertices for a given graph.
JohnsonCircuitsAlgorithm<V, E extends GEdge<V>>	Finds all circuits (loops) in the given graph.
RecursiveFindPathsAlgorithm<V, E extends GEdge<V>>	Finds all paths between two vertices for a given graph.
SorterException	Occurs when a graph cannot be sorted
TarjanStronglyConnectedAlgorthm<V, E extends GEdge<V>>
TopologicalSorter<V, E extends GEdge<V>>	Computes a topological sorting of the vertices in a directed acyclic graph (DAG)