求教大牛，关于算法Dijkstra的问题

0 0

求教大牛，关于算法Dijkstra的问题10

想要的功能是找出所有可以到达终点的路线，并且找出最短的；
现在光是找出到终点显示都有问题，请教大牛帮忙看一看

package page2;

import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;
import java.util.Map;

public class TestArlgor1 {

	static List<Node> listOpen = new ArrayList();// 待选

	List<Node> listClose = new ArrayList();// 已走

	static List<Node> allConn = new ArrayList();// 所有

	static List<List> yesList = new ArrayList();// 所有

	static Map map = new HashMap();

	public static void main(String[] args) {

		String sStart = "A";//站点A
		String sEnd = "Z";//站点Z
		
		//用Dijkstra 实现A-Z的路径

		allConn.add(new Node("E", "D", "12"));//站点E、站点D、线路12
		allConn.add(new Node("D", "I", "12"));
		allConn.add(new Node("I", "J", "12"));
		allConn.add(new Node("J", "K", "12"));
		allConn.add(new Node("K", "L", "12"));
		allConn.add(new Node("L", "M", "12"));
		allConn.add(new Node("M", "N", "12"));
		allConn.add(new Node("N", "O", "12"));
		allConn.add(new Node("O", "Z", "12"));

		allConn.add(new Node("A", "B", "11"));
		allConn.add(new Node("B", "C", "11"));
		allConn.add(new Node("C", "D", "11"));
		allConn.add(new Node("D", "E", "11"));
		allConn.add(new Node("E", "F", "11"));
		allConn.add(new Node("F", "G", "11"));
		allConn.add(new Node("G", "H", "11"));
		allConn.add(new Node("H", "I", "11"));
		allConn.add(new Node("I", "J", "11"));

		TestArlgor1 ta = new TestArlgor1();
		List listClose1 = new ArrayList();
		List list = ta.getShort("A", "Z", listClose1);
		for (int i = 0; i < list.size(); i++) {
			Node node = (Node) list.get(i);
			System.out.println(node.getStart()+"|"+node.getEnd()+"|"+node.getLineNum());
		}
	}

	public static List<Node> getShort(String start, String end, List<Node> listClose) {

		for (Node a : allConn) {// 遍历所有集合点
			if (start == a.getStart() || start == a.getEnd()) {// 查找出开始结束点是起点的

				if (listClose.contains(a)) {
					continue;
				} else {

					System.out.println("listOpenAdd:" + a.getStart() + "|" + a.getEnd()
							+ "|" + a.getLineNum());
//					listOpen.add(a);// 加入待选点

					// 等于终点
					if (end == a.getStart() || end == a.getEnd()) {

						listClose.add(a);
						yesList.add(listClose);
						System.out.println("jg");

						return listClose;
					} else {

						// 重新选择原点
						if (!start.equals(a.getStart())) {
							System.out.println("start = b.getStart():" + a.getStart());
							start = a.getStart();
						}

						if (!start.equals(a.getEnd())) {
							System.out.println("start = b.getEnd():" + a.getStart());
							start = a.getEnd();
						}

						System.out.println("start:" + start);

						listClose.add(a);

						getShort(start, end, listClose);
					}
				}
			}
		}

		if (allConn.containsAll(listClose)) {
			System.out.println("遍历结束");
			return listClose;
		}
		return listClose;
	}
}


class Node {
	
	private String start;

	private String end;

	private String lineNum;
	
	private boolean isRun;

	public Node() {
	}

	public Node(String start, String end, String lineNum) {
		this.start = start;
		this.end = end;
		this.lineNum = lineNum;
	}

	
	public String getStart() {
		return start;
	}

	public void setStart(String start) {
		this.start = start;
	}

	public String getEnd() {
		return end;
	}

	public void setEnd(String end) {
		this.end = end;
	}

	public String getLineNum() {
		return lineNum;
	}

	public void setLineNum(String lineNum) {
		this.lineNum = lineNum;
	}

	public boolean isRun() {
		return isRun;
	}

	public void setRun(boolean isRun) {
		this.isRun = isRun;
	}


}