/*
 * Copyright 2009 Wishnu Prasetya.
 *
 * This file is part of T2.
 * T2 is free software; you can redistribute it and/or modify it under
 * the terms of the GNU General Public License (GPL) as published by the
 * Free Software Foundation; either version 3 of the License, or any
 * later version.
 * 
 * T2 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 General Public License
 * for more details.
 *
 * A copy of the GNU General Public License can be found in T2 distribution.
 * If it is missing, see http://www.gnu.org/licenses.
 */
package Sequenic.T2ext.Instrumenter;

import java.util.*;

import Sequenic.Graph.*;

/**
 * Provides functionalities to calculate the set of primepaths of a given
 * CFG.
 * 
 * <p>Note: now this is just a proxy class. The actual algorithm for 
 * calculating prime paths is moved to the Graph package. 
 * 
 * @author Wishnu Prasetya
 * @author Maaike Gerritsen
 */
public class PrimePathCalculator {
	
	CFG CFG ;
	
	public PrimePathCalculator(CFG cfg) {
		CFG = cfg;
	}
	
	public void calculatePrimePath(){
		CFG.targetPaths = (LinkedList<LinkedList<Node>>) ((Object)
		PrimePathUtil.getPrimePaths(CFG, CFG.getStartNode())) ;
	}
	
	static public void calculatePrimePath(CFG CFG) {
		CFG.targetPaths = (LinkedList<LinkedList<Node>>) ((Object)
		PrimePathUtil.getPrimePaths(CFG, CFG.getStartNode())) ;
	}
	
}