Package ghidra.graph
package ghidra.graph
-
ClassDescriptionDefaultGEdge<V>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 explicitlyA set of convenience methods for performing graph algorithms on a graph.GraphPath<V>Class for storing paths with fast "contains" method.GraphPathSet<V>An edge having a natural weightMutableGDirectedGraphWrapper<V,E extends GEdge<V>> A class that can wrap aGDirectedGraphand allows for vertex and edge additions without changing the underlying graph.Defines a common set of vertex and edge typesGraphTypefor program code and data flow graphs.The primary interface for graphs that are to be rendered.VisualGraphComponentProvider<V extends VisualVertex,E extends VisualEdge<V>, G extends VisualGraph<V, E>> A base component provider for displayingVisualGraphs