<commit_before>import java.io.IOException;

/**
 * User: ijk
 * Date: 11/17/13
 */
public class Main {
    public static void main(String[] args) throws IOException{
        System.out.println("Welcome to Graph Isomorphism!");

        //The following makes a "kite" graph G (with "a" as the main node).
        /*     a-b
               |/|
               c-d
        */
        Node<String> a= new Node("a");
        Node<String> b= new Node("b");
        Node<String> c= new Node("c");
        Node<String> d= new Node("d");
        a.addChild(b);
        a.addChild(c);
        b.addChild(a);
        b.addChild(c);
        b.addChild(d);
        c.addChild(a);
        c.addChild(b);
        c.addChild(d);
        d.addChild(c);
        d.addChild(b);
        Graph G1= new Graph(a);

        Graph G2= new Graph("graph");
        Graph kite= new Graph("kite");

        int n= 128;
        int count= 0;
        int opCount= 0;

        int loops= 100;

        for (int i= 0; i < loops; i++){
            Graph randomGraph5= new Graph(n);

            //Reset the number of operations.
            Graph.numOp= 0;

            int[][] adj5= randomGraph5.adjacency;
            int[][] perm= Checker.makePermutation(n);
            int[][] permTranspose= Checker.makeTranspose(perm);
            int[][] adj5New= Checker.matrixMultiply(perm,adj5);
            adj5New= Checker.matrixMultiply(adj5New,permTranspose);
            //Note: adj5 and adj5New must represent isomorphic graphs.


            Graph A1= new Graph();
            A1.traverseMatrix(adj5);
            Graph A2= new Graph();
            A2.traverseMatrix(adj5New);

            Graph N1= new Graph("star_in_pentagon");
            Graph N2= new Graph("star_in_pentagon_isomess");

            boolean isomorphic= Graph.areIsomorphic(A1, A2);
            if (isomorphic == true) count++;

            System.out.println(" " + (A1.V.size() == A2.V.size()) + " " + isomorphic + " " + Graph.numOp);
            opCount+= Graph.numOp;
        }

//        Graph hyper= new Graph("hypersquare");
//        Graph hypo= new Graph("hypotesseract");
//
//        boolean isomorphic= Graph.areIsomorphic(hyper, hypo);

        System.out.println("Our success ratio is " + count);
        System.out.println("Our total number of operations is " + opCount);
//        System.out.println(isomorphic);
    }
}<commit_msg>Quick sanity check using non-isomorphic graphs.<commit_after>import java.io.IOException;

/**
 * User: ijk
 * Date: 11/17/13
 */
public class Main {
    public static void main(String[] args) throws IOException{
        System.out.println("Welcome to Graph Isomorphism!");

        //The following makes a "kite" graph G (with "a" as the main node).
        /*     a-b
               |/|
               c-d
        */
        Node<String> a= new Node("a");
        Node<String> b= new Node("b");
        Node<String> c= new Node("c");
        Node<String> d= new Node("d");
        a.addChild(b);
        a.addChild(c);
        b.addChild(a);
        b.addChild(c);
        b.addChild(d);
        c.addChild(a);
        c.addChild(b);
        c.addChild(d);
        d.addChild(c);
        d.addChild(b);
        Graph G1= new Graph(a);

        Graph G2= new Graph("graph");
        Graph kite= new Graph("kite");

        int n= 128;
        int count= 0;
        int opCount= 0;

        int loops= 10;

        for (int i= 0; i < loops; i++){
            Graph randomGraph5= new Graph(n);
            Graph randomGraph5_Noniso= new Graph(n);

            //Reset the number of operations.
            Graph.numOp= 0;

            int[][] adj5= randomGraph5.adjacency;
            int[][] perm= Checker.makePermutation(n);
            int[][] permTranspose= Checker.makeTranspose(perm);
            int[][] adj5New= Checker.matrixMultiply(perm,adj5);
            adj5New= Checker.matrixMultiply(adj5New,permTranspose);
            //Note: adj5 and adj5New must represent isomorphic graphs.

            int[][] adj5_Noniso= randomGraph5_Noniso.adjacency;

            Graph A1= new Graph();
            A1.traverseMatrix(adj5);
            Graph A2= new Graph();
            A2.traverseMatrix(adj5_Noniso);

            Graph N1= new Graph("star_in_pentagon");
            Graph N2= new Graph("star_in_pentagon_isomess");

            boolean isomorphic= Graph.areIsomorphic(A1, A2);
            if (isomorphic == true) count++;

            System.out.println(" " + (A1.V.size() == A2.V.size()) + " " + isomorphic + " " + Graph.numOp);
            opCount+= Graph.numOp;
        }

//        Graph hyper= new Graph("hypersquare");
//        Graph hypo= new Graph("hypotesseract");
//
//        boolean isomorphic= Graph.areIsomorphic(hyper, hypo);

        System.out.println("Our success ratio is " + count);
        System.out.println("Our total number of operations is " + opCount);
//        System.out.println(isomorphic);
    }
}
{'fraction_non_alphanumeric': 0.13876472978464038, 'fraction_numerical': 0.016253555465258026, 'mean_word_length': 1.8992932862190812, 'pattern_counts': {'":': 0, '<': 13, '<?xml version=': 0, '>': 11, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'dir': 'git-commits-cleaned', 'id': '451822', 'n_tokens_mistral': 1580, 'n_tokens_neox': 1499, 'n_words': 378}