Class DeterministicDependencyGraph<T>

java.lang.Object
ghidra.util.graph.AbstractDependencyGraph<T>
ghidra.util.graph.DeterministicDependencyGraph<T>
Type Parameters:
T - the type of value.

public class DeterministicDependencyGraph<T> extends AbstractDependencyGraph<T>
Dependency Graph that uses TreeMaps and ListOrderedSets to provide determinism in pulling (AbstractDependencyGraph.pop()) from the graph. This class seems to consume more memory than DependencyGraph, and if memory is not an issue, it also seems to be slightly faster as well.

This class was implemented to provide determinism while doing developmental debugging.

See Also: