abstractfastestway.java

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

/*
 * 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.assemble;

public abstract class AbstractFastestWay implements GetWayInfor {

	protected int[][] a;
	protected int[][] t;
	protected int[] e;
	protected int[] x;
	protected int n;
	
	protected int[][] l;
	protected int lt,ft;
	
	public AbstractFastestWay(int[][] a, int[][] t, int[] e, int[] x, int n) {
		super();
		this.a = a;
		this.t = t;
		this.e = e;
		this.x = x;
		this.n = n;
	}

	public AbstractFastestWay() {
		super();
	}

	public int fastestWay(int[][] a, int[][] t, int[] e, int[] x, int n) {
		this.a = a;
		this.t = t;
		this.e = e;
		this.x = x;
		this.n = n;
		return fastestWay();
	}

	public String getWays(int[][] a, int[][] t, int[] e, int[] x, int n) {
		this.a = a;
		this.t = t;
		this.e = e;
		this.x = x;
		this.n = n;
		return getWays();
	}
	
	public String getWays() {
		fastestWay();
		String s = "";
		int i = lt;
		s = "line "+i+", station "+n+"\n"+s;
		for(int j=n;j>=2;j--){
			i = l[i-1][j-1];
			s = "line "+i+", station "+(j-1)+"\n"+s;
		}
		return s;
	}

}