计算机毕业设计最短路径算法java实现

package test.star; import java.awt.BorderLayout; import java.awt.Button; import java.awt.Color; import java.awt.FlowLayout; import java.awt.Frame; import java.awt.Graphics; import java.awt.GridLayout; import java.awt.Image; import java.awt.Label; import java.awt.Panel; import java.awt.Point; import java.awt.TextField; import java.awt.event.WindowAdapter; import java.awt.event.WindowEvent; import java.awt.image.BufferedImage; import java.util.List; import javax.swing.JPanel; import test.star.*; /** */ /** * <p> * Title: LoonFramework * </p> * <p> * Description:Java的A*寻径实现 * </p> * <p> * Copyright: Copyright (c) 2008 * </p> * <p> * Company: LoonFramework * </p> * <p> * License: http://www.apache.org/licenses/LICENSE-2.0 * </p> * * @author chenpeng * @email：ceponline@yahoo.com.cn * @version 0.1 */ public class Main extends Panel { /** */ /** * */ final static private long serialVersionUID = 1L; final static private int WIDTH = 480; final static private int HEIGHT = 480; final static private int CS = 32; private TestMap map; private PathFinder astar; // 起始坐标1,1 private static Point START_POS = new Point(1, 1); // 目的坐标10,13 private static Point OBJECT_POS = new Point(10,13); private Image screen; private Graphics graphics; private List path; public Main() { setSize(WIDTH, HEIGHT); setFocusable(true);//获得焦点 screen = new BufferedImage(WIDTH, HEIGHT, BufferedImage.TYPE_INT_RGB); //具有可访问图像数据缓冲区的image 8位颜色 graphics = screen.getGraphics(); map = new TestMap(); // 注入地图描述及障碍物描述 astar = new PathFinder(TestMap.MAP, TestMap.HIT); // searchPath将获得两点间移动路径坐标的List集合 // 在实际应用中，利用Thread分步处理List中坐标即可实现自动行走 path = astar.searchPath(START_POS, OBJECT_POS); } public void update(Graphics g) { paint(g); } public void paint(Graphics g) { // 绘制地图 map.draw(graphics); graphics.setColor(Color.RED); graphics.fillRect(START_POS.x * CS, START_POS.y * CS, CS, CS); graphics.setColor(Color.BLUE); graphics.fillRect(OBJECT_POS.x * CS, OBJECT_POS.y * CS, CS, CS); // 绘制路径 if (path != null) { graphics.setColor(Color.YELLOW); // 遍历坐标，并一一描绘 for (int i = 0; i < path.size(); i++) { Node node = (Node) path.get(i); Point pos = node._pos; // 描绘边框 graphics.fillRect(pos.x * CS + 7, pos.y * CS + 7, CS - 14, CS - 14); } } g.drawImage(screen, 0, 0, this); } public static void main(String[] args) { /* Frame frame = new Frame(); frame.setTitle("受限制的最短路径优先实现"); frame.setSize(2*WIDTH, HEIGHT+33); frame.setResizable(false); frame.setLocationRelativeTo(null); frame.setLayout(new GridLayout(1,2)); // JPanel panel1=new JPanel(new FlowLayout()); // panel1.add(new Button("起始点")); // panel1.add(new Button("终止点")); // panel1.add(new Button("受限点")); // Panel1 pel1=new Panel1(); JPanel panel=new JPanel(new GridLayout(10,1)); panel.add(new Label("起始地点")); JPanel panel11=new JPanel(new FlowLayout()); panel11.add(new Label("X:")); panel11.add(new TextField(("1--14"),20)); panel.add(panel11); JPanel panel12=new JPanel(new FlowLayout()); panel12.add(new Label("Y:")); panel12.add(new TextField(("1--14"),20)); panel.add(panel12); panel.add(new Label("终止地点")); JPanel panel21=new JPanel(new FlowLayout()); panel21.add(new Label("X:")); panel21.add(new TextField(("1--14"),20)); panel.add(panel21); JPanel panel22=new JPanel(new FlowLayout()); panel22.add(new Label("Y:")); panel22.add(new TextField(("1--14"),20)); panel.add(panel22); panel.add(new Label("受限地点")); JPanel panel31=new JPanel(new FlowLayout()); panel31.add(new Label("X:")); panel31.add(new TextField(("1--14"),20)); panel.add(panel31); JPanel panel32=new JPanel(new FlowLayout()); panel32.add(new Label("Y:")); panel32.add(new TextField(("1--14"),20)); panel.add(panel32); panel.add(new Button("查找")); frame.add(panel); frame.add(new Main()); frame.setVisible(true); frame.addWindowListener(new WindowAdapter() { public void windowClosing(WindowEvent e) { System.exit(0); } });*/ new UserFrame(); } }