simplefastestwaytests.java

来自「<算法导论>第二版大部分算法实现. 1. 各类排序和顺序统计学相关」· Java 代码 · 共 38 行

/*
 * Copyright (C) 2003-2008 Wang Pengcheng <[e-mail]>
 * Permission is granted to copy, distribute and/or modify this
 * document under the terms of the GNU Free Documentation License,
 * Version 2.0 or any later version published by the Free Software Foundation;
 * with no Invariant Sections.
 * You may obtain a copy of the License at
 *   http://www.gnu.org/licenses/lgpl.txt
 */
//19 Feb 2008
package cn.edu.whu.iss.algorithm.unit15.test;

import cn.edu.whu.iss.algorithm.unit15.assemble.SimpleFastestWay;
import junit.framework.TestCase;

public class SimpleFastestWayTests extends TestCase implements FastestWayTestData{

	private SimpleFastestWay way;
	
	protected void setUp() throws Exception {
		super.setUp();
		way = new SimpleFastestWay();
	}

	public void testFastestWay() {
		for(int i=0;i<n.length;i++){
			assertEquals(ans[i], way.fastestWay(a[i], t[i], e[i], x[i], n[i]));
		}
	}

	public void testGetWays() {
		for(int i=0;i<n.length;i++){
			System.out.println(way.getWays(a[i], t[i], e[i], x[i], n[i]));
		}
	}

}