Package ghidra.graph
-
Interface Summary Interface Description GDirectedGraph<V,E extends GEdge<V>> A directed graph UnlikeGImplicitDirectedGraph
, this graph is constructed explicitly in memory.GEdge<V> An edge in a (usually directed) graphGEdgeWeightMetric<E extends GEdge<?>> A callback to get the weight of an edge Analogous to Java'sComparator
, this provides a means to override the weight of an edge in a graph, or provide a weight in the absence of a natural weight, when executing various graph algorithms, e.g., shortest path.GImplicitDirectedGraph<V,E extends GEdge<V>> A directed graph that need not be constructed explicitlyGVertex GWeightedEdge<V> An edge having a natural weightVisualGraph<V extends VisualVertex,E extends VisualEdge<V>> The primary interface for graphs that are to be rendered. -
Class Summary Class Description BlockFlowGraphType CallGraphType CodeFlowGraphType DataFlowGraphType DefaultGEdge<V> GraphAlgorithms A set of convenience methods for performing graph algorithms on a graph.GraphFactory GraphPath<V> Class for storing paths with fast "contains" method.GraphPathSet<V> MutableGDirectedGraphWrapper<V,E extends GEdge<V>> A class that can wrap aGDirectedGraph
and allows for vertex and edge additions without changing the underlying graph.MutableGDirectedGraphWrapper.DummyEdge ProgramGraphDisplayOptions ProgramGraphType Defines a common set of vertex and edge typesGraphType
for program code and data flow graphs.VisualGraphComponentProvider<V extends VisualVertex,E extends VisualEdge<V>,G extends VisualGraph<V,E>> A base component provider for displayingVisualGraph
s