private List<DependencyRelation> constructRandomRelationships(long seed, int numDependencies,
			int graphSize, boolean allowCycles) {
		List<DependencyRelation> relationships = new ArrayList<>();
		Random generator = new Random(seed);

		// Not taking a dependent beyond 90% of graph size; similar dependee only in latter
		// 90%.
		double factor = 0.90;
		int limit = (int) (factor * graphSize);
		int dependeeOffset = graphSize - limit;
		assert limit != graphSize;

		// TODO: currently ignoring allowCycles parameter.
		// TODO: Do no cycles for now... ask if would need both types for performance testing.
		// To disallow cycles, we simply are preventing the dependee number from being less than
		//  the dependent number.  This weights the graph in an interesting way: dependents with
		//  smaller numbers will tend to have more dependees.
		for (int i = 0; i < numDependencies; i++) {
			int dependentId = generator.nextInt(limit);
			int dependeeId;
			do {
				dependeeId = generator.nextInt(limit) + dependeeOffset;
			}
			while (dependeeId <= dependentId);
			DependencyRelation relation = new DependencyRelation(dependentId, dependeeId);
			relationships.add(relation);
		}
		return relationships;
	}
Performs computation of dependency graph
Does not test the accuracy/functionality of Dependency Graphs.
Ghidra/Framework/Generic/src/test/java/ghidra/util/datastruct/DependencyGraphPerformanceTest.java