bestevertourlabel.java

来自「javaACS 蚁群算法是人工智能的一种算法,这个是用JAVA写的一个求解TSP」· Java 代码 · 共 40 行

/* BESTEVERTOURLABEL */
/* Part of the AntTSP project */
/* Dr Mark C. Sinclair, NPIC, Cambodia, v1.0, November 2006, [e-mail] */
/* You may make use of this code for any purpose, but if you use it, */
/* you must cite the use: Sinclair, M.C., AntTSP Java Applet v1.0, */
/* http://uk.geocities.com/markcsinclair/aco.html, November, 2006 */

import java.awt.*;
import java.util.*;

class BestEverTourLabel extends Label implements Observer {
	public BestEverTourLabel(Network net) {
		super();
		this.net = net;
		setText(label());
		net.addObserver(this);
	}

	public void update(Observable o, Object arg) {
		setText(label());
	}

	private String label() {
		Node[]       bet = net.getBestEverTour();
		StringBuffer buf = new StringBuffer();
		if (bet == null)
			buf.append("null");
		else {
			buf.append("[").append(bet[0].getId());
			for (int i=1; i<bet.length; i++)
				buf.append(",").append(bet[i].getId());
			buf.append("]");
		}
		return(buf.toString());
	}

	private Network net;
	private static final long serialVersionUID = 1L;
}