Package ghidra.util.graph

Interface Summary

Interface	Description
GraphIterator<T extends KeyedObject>	Interface for VertexSet and EdgeSet iterators.
KeyedObject	The KeyedObject class is used as a base class for objects which have keys.
KeyIndexableSet<T extends KeyedObject>	Interface for sets of graph objects which have keys such as vertices and edges.

Class Summary

Class	Description
AbstractDependencyGraph<T>	Class for managing the visiting (processing) of a set of values where some values depend on other values being process before them.
AddableLongDoubleHashtable	This class modifies the behavior of LongDoubleHashtable.
AddableLongIntHashtable	This class modifies the behavior of LongIntHashtable.
DependencyGraph<T>	Original Dependency Graph implementation that uses HashMaps and HashSets.
DepthFirstSearch	Provides a depth first search service to directed graphs.
DeterministicDependencyGraph<T>	Dependency Graph that uses TreeMaps and ListOrderedSets to provide determinism in pulling (AbstractDependencyGraph.pop()) from the graph.
DirectedGraph	Base implementation of a directed graph.
Dominator	Title: Dominator Description: This class contains the functions necessary to build the dominance graph of a FlowGraph, ShrinkWrap or Modularized Graph.
Edge	An Edge joins a pair of vertices.
KeyedObjectFactory	The KeyedObjectFactory class is responsible for ensuring that no two vertices or edges have the same keys.
Path
SimpleWeightedDigraph	A simple graph is a graph with no parallel edges or loops.
Vertex	An implementation of vertices for use in ghidra.util.graph.
WeightedDigraph	DirectedGraph with edge weights.