RepoMirrors
/
baritone
mirror of https://github.com/cabaletta/baritone
1
0
Fork 1
Code Issues Releases Wiki Activity

belongs at bottom

This commit is contained in:
Leijurv 2023-04-07 22:12:57 -07:00
parent 06d18c4500
commit f039a9cff8
No known key found for this signature in database
GPG Key ID: 44A3EA646EADAC6A
1 changed files with 45 additions and 45 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

90
src/main/java/baritone/builder/TarjansAlgorithm.java
View File

@ -47,51 +47,6 @@ public class TarjansAlgorithm {
this.tarjanCallStack = new ArrayDeque<>();
}
private static LongSet sanityCheckResultFrom(DependencyGraphScaffoldingOverlay graph, long start) {
if (graph.air(start)) {
throw new IllegalStateException();
}
LongList startList = new LongArrayList(Collections.singletonList(start));
LongSet reachableForward = DependencyGraphAnalyzer.searchGraph(startList, graph::outgoingEdge);
LongSet reachableBackward = DependencyGraphAnalyzer.searchGraph(startList, graph::incomingEdge);
// correct iff the intersection of reachableForward and reachableBackward is exactly the component containing start
LongSet ret = new LongOpenHashSet();
boolean selection = reachableForward.size() < reachableBackward.size();
LongSet toIterate = selection ? reachableForward : reachableBackward;
LongSet toCheck = selection ? reachableBackward : reachableForward;
LongIterator it = toIterate.iterator();
while (it.hasNext()) {
long pos = it.nextLong();
if (toCheck.contains(pos)) {
ret.add(pos);
}
}
return ret;
}
public static void sanityCheckResult(DependencyGraphScaffoldingOverlay graph, TarjansResult result) {
// this is a much slower (O(n^2) at least instead of O(n)) implementation of finding strongly connected components
Int2ObjectOpenHashMap<LongSet> checkedCids = new Int2ObjectOpenHashMap<>();
LongSet claimedAlready = new LongOpenHashSet();
graph.forEachReal(pos -> {
int cid = result.getComponent(pos);
LongSet componentShouldBe = checkedCids.get(cid);
if (componentShouldBe == null) {
componentShouldBe = sanityCheckResultFrom(graph, pos);
checkedCids.put(cid, componentShouldBe);
LongIterator it = componentShouldBe.iterator();
while (it.hasNext()) {
if (!claimedAlready.add(it.nextLong())) {
throw new IllegalStateException();
}
}
}
if (!componentShouldBe.contains(pos)) {
throw new IllegalStateException();
}
});
}
public static TarjansResult run(DependencyGraphScaffoldingOverlay overlayedGraph) {
TarjansAlgorithm algo = new TarjansAlgorithm(overlayedGraph);
algo.run();
@ -230,4 +185,49 @@ public class TarjansAlgorithm {
private long recursingInto = -1;
private int facesCompleted;
}
public static void sanityCheckResult(DependencyGraphScaffoldingOverlay graph, TarjansResult result) {
// this is a much slower (O(n^2) at least instead of O(n)) implementation of finding strongly connected components
Int2ObjectOpenHashMap<LongSet> checkedCids = new Int2ObjectOpenHashMap<>();
LongSet claimedAlready = new LongOpenHashSet();
graph.forEachReal(pos -> {
int cid = result.getComponent(pos);
LongSet componentShouldBe = checkedCids.get(cid);
if (componentShouldBe == null) {
componentShouldBe = sanityCheckResultFrom(graph, pos);
checkedCids.put(cid, componentShouldBe);
LongIterator it = componentShouldBe.iterator();
while (it.hasNext()) {
if (!claimedAlready.add(it.nextLong())) {
throw new IllegalStateException();
}
}
}
if (!componentShouldBe.contains(pos)) {
throw new IllegalStateException();
}
});
}
private static LongSet sanityCheckResultFrom(DependencyGraphScaffoldingOverlay graph, long start) {
if (graph.air(start)) {
throw new IllegalStateException();
}
LongList startList = new LongArrayList(Collections.singletonList(start));
LongSet reachableForward = DependencyGraphAnalyzer.searchGraph(startList, graph::outgoingEdge);
LongSet reachableBackward = DependencyGraphAnalyzer.searchGraph(startList, graph::incomingEdge);
// correct iff the intersection of reachableForward and reachableBackward is exactly the component containing start
LongSet ret = new LongOpenHashSet();
boolean selection = reachableForward.size() < reachableBackward.size();
LongSet toIterate = selection ? reachableForward : reachableBackward;
LongSet toCheck = selection ? reachableBackward : reachableForward;
LongIterator it = toIterate.iterator();
while (it.hasNext()) {
long pos = it.nextLong();
if (toCheck.contains(pos)) {
ret.add(pos);
}
}
return ret;
}
}