GraphListsHandler.java

Go to the documentation of this file.

/*
 *   DENOPTIM
 *   Copyright (C) 2022 Marco Foscato <marco.foscato@uib.no>
 *
 *   This program is free software: you can redistribute it and/or modify
 *   it under the terms of the GNU Affero General Public License as published
 *   by the Free Software Foundation, either version 3 of the License, or
 *   (at your option) any later version.
 *
 *   This program is distributed in the hope that it will be useful,
 *   but WITHOUT ANY WARRANTY; without even the implied warranty of
 *   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 *   GNU Affero General Public License for more details.
 *
 *   You should have received a copy of the GNU Affero General Public License
 *   along with this program.  If not, see <http://www.gnu.org/licenses/>.
 */
 
package  denoptim.programs.graphlisthandler;
 
import java.io.File;
import java.util.HashSet;
import java.util.Set;
import java.util.logging.Level;
 
import denoptim.graph.DGraph;
import denoptim.task.ProgramTask;
 
 
public class GraphListsHandler extends ProgramTask
{
 
//------------------------------------------------------------------------------
    
    public GraphListsHandler(File configFile, File workDir)
    {
        super(configFile,workDir);
    }
    
//------------------------------------------------------------------------------
 
    @Override
    public void runProgram() throws Throwable
    {
        GraphListsHandlerParameters glhParams = new GraphListsHandlerParameters();
        glhParams.readParameterFile(configFilePathName.getAbsolutePath());
        glhParams.checkParameters();
        glhParams.processParameters();
        glhParams.startProgramSpecificLogger(loggerIdentifier,false); //to STDOUT
        glhParams.printParameters();
 
        Set<DGraph> matchedA = new HashSet<DGraph>();
        Set<DGraph> matchedB = new HashSet<DGraph>();
        
        int i = -1;
        for (DGraph gA :  glhParams.inGraphsA)
        {
            i++;
            int j = -1;
            for (DGraph gB :  glhParams.inGraphsB)
            {
                j++;
                glhParams.getLogger().log(Level.INFO, NL + "-> Comparing " + i 
                        + " and "+j);
                if (gA.isIsomorphicTo(gB))
                {
                    glhParams.getLogger().log(Level.INFO, " SAME!");
                    matchedA.add(gA);
                    matchedB.add(gB);
                    break;
                } else {
                    glhParams.getLogger().log(Level.INFO, " Different");
                }
            }
        }
        
        glhParams.getLogger().log(Level.INFO, NL + " #Matches in list A: " 
                + matchedA.size()+"/"
                + glhParams.inGraphsA.size());
        glhParams.getLogger().log(Level.INFO, " #Matches in list B: " 
                + matchedB.size()+"/"
                + glhParams.inGraphsB.size());
        
        glhParams.getLogger().log(Level.INFO, NL + " ===> Un-matches in list A");
        int ii = -1;
        for (DGraph gA : glhParams.inGraphsA)
        {
            ii++;
            if (matchedA.contains(gA))
            {
                continue;
            }
            glhParams.getLogger().log(Level.INFO, NL + "Entry in original list "
                    + "#" + ii);
            glhParams.getLogger().log(Level.INFO, gA.toString());
        }
        
        glhParams.getLogger().log(Level.INFO, NL + " ===> Un-matches in list B");
        int jj = -1;
        for (DGraph gB : glhParams.inGraphsB)
        {
            jj++;
            if (matchedB.contains(gB))
            {
                continue;
            }
            glhParams.getLogger().log(Level.INFO, NL + "Entry in original list"
                    + " #" + jj);
            glhParams.getLogger().log(Level.INFO, gB.toString());
        }
    }
    
//------------------------------------------------------------------------------
 
}