package jimena.analysis;

import java.io.File;
import java.util.ArrayList;
import java.util.Random;
import java.util.Set;
import java.util.TreeSet;

import jimena.binaryrn.NetworkInput;
import jimena.binaryrn.RegulatoryNetwork;
import jimena.calculationparameters.SSSearchParameters;
import jimena.calculationparameters.StandardSSSSearchParameters;
import jimena.libs.BDDLib;
import jimena.simulationmethods.SQUADMethod;

/**
 * A method to reduce a given network.
 * 
 * @author Stefan Karl, Department of Bioinformatics, University of Würzburg, stefan[dot]karl[at]uni-wuerzburg[dot]de
 * 
 */
public class NewGreedyReduction {

    public static void main(String[] args) {
        // Create a new GRN

        RegulatoryNetwork network = new RegulatoryNetwork();
        network.loadYEdFile(new File("I:\\realnetworks\\Th\\Th 2010 Version corrected layouted squeezed.graphml"));
        // network.loadYEdFile(new File("I:\\Controllability\\FigureExplainingSupportingNetworks\\jimenared.graphml"));

        BDDLib.forceJavaImplementation();

        SSSearchParameters parameters = new StandardSSSSearchParameters(new SQUADMethod(), 0.05);

        TreeSet<Integer> nodesToConsider = new TreeSet<Integer>();
        // // nodesToConsider.add(network.getNodeIndexByName("A"));
        // nodesToConsider.add(network.getNodeIndexByName("B"));
        // // nodesToConsider.add(network.getNodeIndexByName("C"));
        // nodesToConsider.add(network.getNodeIndexByName("D"));
        // // nodesToConsider.add(network.getNodeIndexByName("E"));

        nodesToConsider.add(network.getNodeIndexByName("Foxp3"));
        nodesToConsider.add(network.getNodeIndexByName("RORgt"));
        nodesToConsider.add(network.getNodeIndexByName("Tbet"));
        nodesToConsider.add(network.getNodeIndexByName("GATA3"));

        NewGreedyReduction.reduce(network, 1E-4d, parameters, nodesToConsider, 5, 5);
        
        network.printNetwork();
    }

    /**
     * Remove input lines from a network as long as the difference to the original network stays below a given limit.
     * 
     * @param network
     *            The network to reduce.
     * @param maxDiff
     *            The maximum difference.
     * @param nodesToConsider
     *            The nodes to consider for the comparison
     * @return The reduced network.
     */
    public static RegulatoryNetwork reduce(RegulatoryNetwork network, double maxDiff, SSSearchParameters parameters,
            Set<Integer> nodesToConsider, int simulations, int innersimulations) {
        RegulatoryNetwork curNetwork = network.cloneClean();

        NetworkInputsSet usedInputs = new NetworkInputsSet();

        Random randomGenerator = new Random();

        ArrayList<NetworkInput> inputs = network.getInputs();
        NetworkInput currentlyTested = inputs.get(randomGenerator.nextInt(inputs.size())); // TODO: Wenn keine da

        for (int counter = 0; counter < network.getInputs().size(); counter++) {
            currentlyTested = network.getNextInputWrap(currentlyTested);
            if (usedInputs.contains(currentlyTested)) {
                continue;
            }
            System.out.print(currentlyTested);

            double diff = FunctionsAnalysis.dynamicCentrality(curNetwork, currentlyTested, simulations, innersimulations, parameters,
                    nodesToConsider, nodesToConsider, maxDiff);
            System.out.println(": " + diff);

            if (diff < maxDiff) {
                curNetwork.addNullMutation(currentlyTested);
                usedInputs.add(currentlyTested);
                counter = 0;

                System.out.print("Logged in: ");
                System.out.print(network.getNetworkNodes()[network.getNetworkNodes()[currentlyTested.getNode()].getInputs()[currentlyTested
                        .getInput()].getSource()].getName() + " => " + network.getNetworkNodes()[currentlyTested.getNode()].getName());
                System.out.print(" (" + currentlyTested.getNode() + ":" + currentlyTested.getInput() + ") to " + diff + "\n");
            }
        }

        return curNetwork;
    }

}
