package signature;

import org.junit.Assert;
import org.junit.Test;


import signature.DAG;
import signature.Invariants;

public class DAGTester {
    
    public void testInvariants(
            int[] nodeInv, int[] vertexInv, Invariants invariants) {
        // TODO
//        Assert.assertArrayEquals(nodeInv, invariants.nodeInvariants);
//        Assert.assertArrayEquals(vertexInv, invariants.vertexInvariants);
    }
    
    @Test
    public void testColoring() {
        // C12CC1C1
        DAG ring = new DAG(0, 4);
        DAG.Node root = ring.getRoot();
        
        DAG.Node child1 = ring.makeNodeInLayer(1, 1);
        ring.addRelation(child1, root);
        
        DAG.Node child2 = ring.makeNodeInLayer(2, 1);
        ring.addRelation(child2, root);
        
        DAG.Node child3 = ring.makeNodeInLayer(3, 1);
        ring.addRelation(child3, root);
        
        DAG.Node child4 = ring.makeNodeInLayer(3, 2);
        ring.addRelation(child4, child1);
        ring.addRelation(child4, child2);
        
        DAG.Node child5 = ring.makeNodeInLayer(1, 2);
        ring.addRelation(child5, child3);
        
        DAG.Node child6 = ring.makeNodeInLayer(2, 2);
        ring.addRelation(child6, child3);
        
        System.out.println(ring);
        String[] labels = new String[] { "C", "C", "C"};
        ring.initializeWithStringLabels(labels);
        
        ring.updateNodeInvariants(DAG.Direction.UP);
        System.out.println(ring.copyInvariants());
        
        ring.computeVertexInvariants();
        System.out.println(ring.copyInvariants());
        
        ring.updateNodeInvariants(DAG.Direction.DOWN);
        System.out.println(ring.copyInvariants());
        
        ring.computeVertexInvariants();
        System.out.println(ring.copyInvariants());
        
        ring.updateVertexInvariants();
        System.out.println(ring.copyInvariants());
        
//        List<Integer> orbit = ring.createOrbit();
//        System.out.println(orbit);
//        
//        ring.setColor(orbit.get(0), 1);
//        ring.updateVertexInvariants();
//        System.out.println(ring.copyInvariants());
//
//        orbit = ring.createOrbit();
//        System.out.println(orbit);
//        
//        ring.setColor(orbit.get(0), 2);
//        ring.updateVertexInvariants();
//        System.out.println(ring.copyInvariants());
//
//        orbit = ring.createOrbit();
//        System.out.println(orbit);
//        ring.setColor(orbit.get(0), 3);
//        System.out.println(ring.copyInvariants());
    }
    
    @Test
    public void testColoringForUnlabelledThreeCycle() {
        DAG dag = new DAG(0, 3);
        DAG.Node root = dag.getRoot();
        
        DAG.Node childA = dag.makeNodeInLayer(1, 1);
        dag.addRelation(childA, root);
        
        DAG.Node childB = dag.makeNodeInLayer(2, 1);
        dag.addRelation(childB, root);
        
        DAG.Node childC = dag.makeNodeInLayer(2, 2);
        dag.addRelation(childC, childA);
        
        DAG.Node childD = dag.makeNodeInLayer(1, 2);
        dag.addRelation(childD, childB);
        
        System.out.println(dag);
        dag.initializeWithStringLabels(new String[] {"C", "C"});
        
        dag.updateVertexInvariants();
        System.out.println(dag.copyInvariants());
        
        dag.setColor(1, 1);
        dag.updateVertexInvariants();
        System.out.println(dag.copyInvariants());
    }

    @Test 
    public void testSimpleUnlabelledDAG() { 
        // Sets up a simple test case with a graph that looks like this:
        //             0 - Node (vertexIndex - label)
        //            / \
        //    1 - Node  2 - Node

        DAG simpleDAG = new DAG(0, 3);


        // First do all the initializations related to the nodes of the graph.
        // Create the nodes.
        DAG.Node parentNode = simpleDAG.getRoot();
        DAG.Node childNode;
        
        // Add the first child.
        childNode = simpleDAG.makeNodeInLayer(1, 1);
        simpleDAG.addRelation(childNode, parentNode);
        
        // Add the second child.
        childNode = simpleDAG.makeNodeInLayer(2, 1);
        simpleDAG.addRelation(childNode, parentNode);

        // Initialize the all invariants.
        simpleDAG.initializeWithStringLabels(new String[] {"Node", "Node", "Node"});

        // Canonize DAG by a simple Hopcroft-Tarjan sweep.
        int [] nodeInvariants = {0, 0, 0};
        int [] vertexInvariants = {1, 2, 2};
        testInvariants(
                nodeInvariants, vertexInvariants, simpleDAG.copyInvariants());

        simpleDAG.updateNodeInvariants(DAG.Direction.DOWN);
        int [] nodeInvariantsAfterDown = {1, 0, 0};
        int [] vertexInvariantsAfterDown = {1, 2, 2};
        testInvariants(nodeInvariantsAfterDown, 
                       vertexInvariantsAfterDown,
                       simpleDAG.copyInvariants());

        simpleDAG.computeVertexInvariants();
        int [] nodeInvariantsAfterComputeVertexInv = {1, 0, 0};
        int [] vertexInvariantsAfterComputeVertexInv = {2, 1, 1};
        testInvariants(nodeInvariantsAfterComputeVertexInv, 
                       vertexInvariantsAfterComputeVertexInv,
                       simpleDAG.copyInvariants());

        simpleDAG.updateNodeInvariants(DAG.Direction.UP);
        int [] nodeInvariantsAfterUp = {1, 1, 1};
        int [] vertexInvariantsAfterUp = {2, 1, 1};
        testInvariants(nodeInvariantsAfterUp, 
                       vertexInvariantsAfterUp,
                       simpleDAG.copyInvariants());

        String simpleDAGString = simpleDAG.toString();
        String expected = "[0 Node ([], [1,2])]\n[1 Node ([0], []), " +
        		          "2 Node ([0], [])]\n";
        Assert.assertEquals(expected,simpleDAGString);
    }

    @Test 
    public void testSimpleLabelledDAG(){ // throws Exception {
        // Sets up a simple test case with a graph that looks like this:
        //             0 - Node0 (vertexIndex - label)
        //            / \
        //    1 - Node2  2 - Node1

        DAG simpleDAG = new DAG(0, 3);


        // First do all the initializations related to the nodes of the graph.
        // Create the nodes.
        DAG.Node parentNode = simpleDAG.getRoot();
        // Add the first child.
        DAG.Node childNode = simpleDAG.makeNodeInLayer(1, 1);
        simpleDAG.addRelation(childNode, parentNode);
        // Add the second child.
        childNode = simpleDAG.makeNodeInLayer(2, 1);
        simpleDAG.addRelation(childNode, parentNode);

        // Initialize the all invariants.
        simpleDAG.initializeWithStringLabels(new String[] {"Node0", "Node2", "Node1"});

        //System.out.println(simpleDAG.toString());

        // Canonize DAG by a simple Hopcroft-Tarjan sweep.
        int [] nodeInvariants = {0, 0, 0};
        int [] vertexInvariants = {1, 3, 2};
        testInvariants(
                nodeInvariants, vertexInvariants, simpleDAG.copyInvariants());

        simpleDAG.updateNodeInvariants(DAG.Direction.DOWN);
        int [] nodeInvariantsAfterDown = {1, 0, 0};
        int [] vertexInvariantsAfterDown = {1, 3, 2};
        testInvariants(nodeInvariantsAfterDown, 
                       vertexInvariantsAfterDown,
                       simpleDAG.copyInvariants());
        
        simpleDAG.computeVertexInvariants();
        int [] nodeInvariantsAfterComputeVertexInv = {1, 0, 0};
        int [] vertexInvariantsAfterComputeVertexInv = {2, 1, 1};
        testInvariants(nodeInvariantsAfterComputeVertexInv, 
                       vertexInvariantsAfterComputeVertexInv,
                       simpleDAG.copyInvariants());
        
        simpleDAG.updateNodeInvariants(DAG.Direction.UP);
        int [] nodeInvariantsAfterUp = {1, 1, 1};
        int [] vertexInvariantsAfterUp = {2, 1, 1};
        testInvariants(nodeInvariantsAfterUp, 
                       vertexInvariantsAfterUp,
                       simpleDAG.copyInvariants());
    }
    
    @Test
    public void dagWithEdgeLabels() {
        DAG dag = new DAG(0, 4);
        DAG.Node root = dag.getRoot();
        
        DAG.Node child = dag.makeNodeInLayer(1, 1);
        dag.addRelation(root, child);
        child.addEdgeColor(0, 2);
        root.addEdgeColor(1, 2);
        
        child = dag.makeNodeInLayer(2, 1);
        dag.addRelation(root, child);
        child.addEdgeColor(0, 1);
        root.addEdgeColor(2, 1);
        
        child = dag.makeNodeInLayer(3, 1);
        dag.addRelation(root, child);
        child.addEdgeColor(0, 1);
        root.addEdgeColor(3, 1);
        
        dag.initializeWithStringLabels(new String[] { "C", "C", "C", "H" });
        dag.updateVertexInvariants();
        System.out.println(dag.copyInvariants());
    }


}