/************************************************************************\
|* gtf is a framework for analyzing two-player zero-sum games           *|
|* Copyright (C) 2005 Troels Bjerre Sorensen                            *|
|*                                                                      *|
|* This program is free software; you can redistribute it and/or modify *|
|* it under the terms of the GNU General Public License as published by *|
|* the Free Software Foundation; either version 2 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    *|
|* General Public License for more details.                             *|
|*                                                                      *|
|* You should have received a copy of the GNU General Public License    *|
|* along with this program; if not, write to the                        *|
|* Free Software Foundation, Inc., 59 Temple Place - Suite 330,         *|
|* Boston, MA 02111-1307, USA.                                          *|
\************************************************************************/

package gtf.util;

import gtf.game.Strategy;
import java.util.*;

public abstract class LPSolver<T extends Real<T>> {
	public static LPSolver getLPSolver() {
		return new PCx();
	}

	protected abstract Map<String, T> solve(MPS<T> problem);

	public Strategy<T> solve(MPS<T> problem, Map<String, String> vars) {
		Map<String, T> result = new HashMap<String, T>();
		Map<String, T> solution = solve(problem);
		for (Map.Entry<String, String> entry : vars.entrySet()) {
			T obj = solution.get(entry.getValue());
			if (obj != null) {
				result.put(entry.getKey(), solution.get(entry.getValue()));
			}
		}
		return new Strategy<T>(result); 
	}
}