Package ghidra.util.graph

Class DependencyGraph<T>

java.lang.Object

ghidra.util.graph.AbstractDependencyGraph<T>

ghidra.util.graph.DependencyGraph<T>

Type Parameters:

T - the type of value. This class uses the values as keys in HashSets, so the value type must be meet the equals() and hashCode() requirements for hashing.

public class DependencyGraph<T>
extends AbstractDependencyGraph<T>

Original Dependency Graph implementation that uses HashMaps and HashSets. Side affect of these is that data pulled from the graph (AbstractDependencyGraph.pop()) is not performed in a deterministic order. However, load time for the graph is O(1).

See Also:

• AbstractDependencyGraph
• DeterministicDependencyGraph

Nested Class Summary

Nested classes/interfaces inherited from class ghidra.util.graph.AbstractDependencyGraph

AbstractDependencyGraph.DependencyNode

Field Summary

Fields inherited from class ghidra.util.graph.AbstractDependencyGraph

nodeMap, unvisitedIndependentSet

Constructor Summary

Constructors

Constructor	Description
DependencyGraph()
DependencyGraph(DependencyGraph<T> other)	Copy constructor

Method Summary

Modifier and Type	Method	Description
DependencyGraph<T>	copy()	Returns a copy of this graph.
protected Set<AbstractDependencyGraph<T>.DependencyNode>	createDependencyNodeSet()	Creates the Set of AbstractDependencyGraph<T>.DependencyNodes appropriate for the implementer.
protected Map<T,AbstractDependencyGraph<T>.DependencyNode>	createNodeMap()	Creates the Map of Nodes to AbstractDependencyGraph<T>.DependencyNodes appropriate for the implementer.
protected Set<T>	createNodeSet()	Creates the Set of Nodes appropriate for the implementer.
Set<T>	getNodeMapValues()	Returns the set of values in this graph.

Methods inherited from class ghidra.util.graph.AbstractDependencyGraph

addDependency, addValue, contains, getAllIndependentValues, getDependentValues, getNodeMap, getUnvisitedIndependentValues, getValues, hasCycles, hasUnVisitedIndependentValues, isEmpty, pop, remove, size

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

DependencyGraph

public DependencyGraph()

DependencyGraph

public DependencyGraph(DependencyGraph<T> other)

Copy constructor

Parameters:

other - the other DependencyGraph to copy

Method Details

copy

public DependencyGraph<T> copy()

Description copied from class: AbstractDependencyGraph

Returns a copy of this graph.

Specified by:

copy in class AbstractDependencyGraph<T>

Returns:

a copy of this graph.

createNodeMap

protected Map<T,AbstractDependencyGraph<T>.DependencyNode> createNodeMap()

Description copied from class: AbstractDependencyGraph

Creates the Map of Nodes to AbstractDependencyGraph<T>.DependencyNodes appropriate for the implementer.

Specified by:

createNodeMap in class AbstractDependencyGraph<T>

Returns:

a new Map of Nodes to AbstractDependencyGraph<T>.DependencyNodes.

createNodeSet

protected Set<T> createNodeSet()

Description copied from class: AbstractDependencyGraph

Creates the Set of Nodes appropriate for the implementer.

Specified by:

createNodeSet in class AbstractDependencyGraph<T>

Returns:

a new Set of Nodes.

createDependencyNodeSet

protected Set<AbstractDependencyGraph<T>.DependencyNode> createDependencyNodeSet()

Description copied from class: AbstractDependencyGraph

Creates the Set of AbstractDependencyGraph<T>.DependencyNodes appropriate for the implementer.

Specified by:

createDependencyNodeSet in class AbstractDependencyGraph<T>

Returns:

a new Set of AbstractDependencyGraph<T>.DependencyNodes.

getNodeMapValues

public Set<T> getNodeMapValues()

Description copied from class: AbstractDependencyGraph

Returns the set of values in this graph.

Specified by:

getNodeMapValues in class AbstractDependencyGraph<T>

Returns:

the set of values in this graph.