Package ghidra.graph.algo
package ghidra.graph.algo
-
ClassDescriptionChkDominanceAlgorithm<V,
E extends GEdge<V>> This algorithm is an implementation of the Cooper, Harvey, Kennedy algorithm.ChkPostDominanceAlgorithm<V,E extends GEdge<V>> This isChkDominanceAlgorithmwith 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 algorithmFindPathsAlgorithm<V,E extends GEdge<V>> An interface and state values used to follow the state of vertices as they are processed by algorithmsGraphNavigator<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.Occurs when a graph cannot be sortedTarjanStronglyConnectedAlgorthm<V,E extends GEdge<V>>