just in case anyone is curious, check in my partial impl from last year of euler tour forests over splay nodes (it was too intimidating to fully reimpl on top of a red-black or avl tree)

2023-03-15 14:53:19 -07:00
parent 52f795c3ae
commit 236d171d15
2 changed files with 868 additions and 0 deletions
--- a/src/test/java/com/github/btrekkie/connectivity/test/ConnGraphTest.java
+++ b/src/test/java/com/github/btrekkie/connectivity/test/ConnGraphTest.java
@@ -2,6 +2,7 @@ package com.github.btrekkie.connectivity.test;

 import com.github.btrekkie.connectivity.ConnGraph;
 import com.github.btrekkie.connectivity.ConnVertex;
+import com.github.leijurv.EulerTourForest;
 import org.junit.Test;

 import java.util.*;
@@ -15,6 +16,7 @@ public class ConnGraphTest {

    @Test
    public void testPerformanceOnRepeatedConnectionAndDisconnection() {
+        EulerTourForest.sanityCheck();
        for (int trial = 0; trial < 10; trial++) {
            try {
                Thread.sleep(2000);