这是一个较为简单的算法。思路是为每一个点创建四个值，上下左右。然后判断最大的值，然后让点往哪个方向走，然后死循环,知道到达最终点，其中判断点的不同方向的距离用多线程实现，每一个线程计算一个方向。这种算法并一定能保证所寻路径一定最短，也不能保证所有类型的图片都一定能找到路。但是速度较快。同样分为三个类。GUI实现界面类，点的类,算法类
GUI
import java.io.*;
import java.awt.*;
import javax.swing.*;
import java.util.*;
import java.awt.event.*;
import javax.swing.event.*;
import javax.imageio.ImageIO;
import java.awt.image.BufferedImage;
public class MainFram extends JFrame implements ActionListener
{
//现在面板上把图片画出来,然后给按钮添加空间,发生点击时间时重绘图片,算法写在重绘的方法里
JLabel l1;
JButton b1,b2,b;
JPanel panBasic,pan1,pan2;
BufferedImage img;
String str="E:\\Editplus\\寻路图片\\1.bmp";
int i=1;
//AStar load;
zhijingxunlu load;
MainFram(){
setTitle("寻路算法");
l1=new JLabel("图片1");
b1=new JButton("<<");
b2=new JButton(">>");
b=new JButton("开始寻路");
setLayout(null);
this.setSize(650,400);
this.setLocation(200,200);
panBasic=new Mypanel();
l1.setBounds(270,10,50,30);
panBasic.setBounds(150,50,330,230);
b1.setBounds(180,290,50,30);
b2.setBounds(260,290,50,30);
b.setBounds(350,290,100,30);
this.add(l1);
this.add(panBasic);
this.add(b1);
this.add(b2);
this.add(b);
this.setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE);
this.setVisible(true);
b1.addActionListener(this);
b2.addActionListener(this);
b.addActionListener(this);
}
public static void main(String[] args)
{
new MainFram();
}
public void paint() {//绘制寻路图片的方法
Graphics g=panBasic.getGraphics();//获得当前界面上的值，后面改变图片都是重绘pan1，只有pan1由Graphics
//load=new AStar();
load=new zhijingxunlu();//Point
load.setImage(img);
g.setColor(Color.red);
g.drawString("起点",load.getsPoint().getX(), load.getsPoint().getY());
g.fillRect(load.getsPoint().getX(), load.getsPoint().getY(), 3, 3);
g.fillRect(load.getePoint().getX(), load.getePoint().getY(), 3, 3);
g.drawString("终点", load.getePoint().getX()-25,load.getePoint().getY());
System.out.println("起点:("+load.getsPoint().getX()+","+load.getsPoint().getY()+")");
System.out.println("终点:("+load.getePoint().getX()+","+load.getePoint().getY()+")");
try
{
load.search();//寻路算法Node
}
catch (Exception e)
{
}
for(int i=0;i<load.resultList.size();i++){
g.fillRect(load.resultList.get(i).getX(),load.resultList.get(i).getY(),1,1);
}
System.out.println(load.resultList.size()+"个节点");
}
class Mypanel extends JPanel
{
public void paint(Graphics g){
super.paint(g);
try{
img=ImageIO.read(new File(str));
}
catch(IOException e){
System.out.println(e.toString());
}
g.drawImage(img,0,0,null);
}
}
public void actionPerformed(ActionEvent e) {
if(e.getSource()==b1){
if(i>1){
--i;
str="E:\\Editplus\\寻路图片\\"+i+".bmp";
pan1=new Mypanel();
l1.setText("图片"+i);
this.repaint();
}
}
if(e.getSource()==b2){
if(i<15){
++i;
str="E:\\Editplus\\寻路图片\\"+i+".bmp";
pan2=new Mypanel();
l1.setText("图片"+i);
this.repaint();
}
}
if(e.getSource()==b){
paint();
}
}
}class Point
{
private int x;
private int y;
private int left;
private int right;
private int up;
private int down;
private int zs;
private int zx;
private int ys;
private int yx;
private int fx;
Point parPoint;
Point(int i, int j, Point point)
{
x = i;
y = j;
parPoint = point;
}
public void setX(int i)
{
x = i;
}
public void setY(int i)
{
x = i;
}
public int getX()
{
return x;
}
public int getY()
{
return y;
}
public int getYS(){
return ys;
}
public int getYX(){
return yx;
}
public int getZX(){
return zx;
}
public int getZS(){
return zx;
}
public void setF(int i)
{
fx = i;
}
public int getF()
{
return fx;
}
public void setL(int i)
{
left = i;
}
public void setR(int i)
{
right = i;
}
public void setD(int i)
{
down = i;
}
public void setU(int i)
{
up = i;
}
public void setYS(int i){
ys=i;
}
public void setYX(int i){
yx=i;
}
public void setZX(int i){
zx=i;
}
public void setZS(int i){
zs=i;
}
public void setparPoint(Point point)
{
parPoint = point;
}
public int getL()
{
return left;
}
public int getR()
{
return right;
}
public int getU()
{
return up;
}
public int getD()
{
return down;
}
public Point getparPoint()
{
return parPoint;
}
public String toString(){
String s="点的x坐标:"+this.x+" y坐标:"+this.y +"\n"+"点的父节点:"+parPoint+"\n";
return s;
}
}
// Decompiled by Jad v1.5.8e2. Copyright 2001 Pavel Kouznetsov.
// Jad home page: http://kpdus.tripod.com/jad.html
// Decompiler options: packimports(3) fieldsfirst ansi space
// Source File Name: zhijingxunlu.java
import java.util.*;
import java.util.concurrent.*;
import java.awt.image.BufferedImage;
import java.io.PrintStream;
import java.util.ArrayList;
import java.util.Arrays;
class zhijingxunlu
{
private int x;
private int y;
private int left;
private int right;
private int up;
private int down;
private int map_Width;
private int map_Height;
private int map[][];
ArrayList<Point> openList;
ArrayList<Point> closeList;
ArrayList<Point> resultList;
Point sPoint;
Point ePoint;
BufferedImage img;
zhijingxunlu()
{
openList = new ArrayList();
closeList = new ArrayList();
resultList = new ArrayList();
}
public void setImage(BufferedImage bufferedimage)
{
img = bufferedimage;
init();
}
public void init()
{
map_Width = img.getWidth();
map_Height = img.getHeight();
map = new int[map_Width][map_Height];
for (int i = 0; i < map_Width; i++)
{
for (int j = 0; j < map_Height; j++)
{
int k = img.getRGB(i, j);
int l = (k & 0xff0000) >> 16;
int i1 = (k & 0xff00) >> 8;
int j1 = k & 0xff;
if (l == 0 && i1 == 0 && j1 == 0)
map[i][j] = 1;
else
map[i][j] = 0;
}
}
setsPoint();
setePoint();
}
public void setsPoint()
{
byte byte0 = 3;
int i = 0;
int j = 0;
do
{
if (j >= map_Height)
break;
if (map[byte0][j] == 1)
{
i = j;
break;
}
j++;
} while (true);
Point point = new Point(byte0, i, null);
sPoint = point;
}
public void setePoint()
{
int i = map_Width - 3;
int j = 0;
int k = 0;
do
{
if (k >= map_Height)
break;
if (map[i][k] == 1)
{
j = k;
break;
}
k++;
} while (true);
Point point = new Point(i, j, null);
ePoint = point;
}
public Point getsPoint()
{
return sPoint;
}
public Point getePoint()
{
return ePoint;
}
public void search() throws Exception
{
if (sPoint.getX() < 0 || sPoint.getX() > map_Width || sPoint.getY() < 0 || sPoint.getY() > map_Height || ePoint.getX() < 0 || ePoint.getX() > map_Width || ePoint.getY() < 0 || ePoint.getY() > map_Height)
{
System.out.println("传输的点的位置不正确！");
return;
}
if (map[sPoint.getX()][sPoint.getY()] == 0 || map[ePoint.getX()][ePoint.getY()] == 0)
{
System.out.println("初末位置不正确！");
return;
}
long l = System.currentTimeMillis();
openList.add(sPoint);
search(sPoint, ePoint);
if (resultList.size() == 0)
{
System.out.println("没有找到路！");
return;
} else
{
long l1 = System.currentTimeMillis();
System.out.println("寻路的时间为:"+(l1-l)+"ms");
return;
}
}
static int rt=0,up1=0,down1=0,lt=0;
public void search(Point points, Point pointe) throws Exception
{
boolean flag = false;
Point point =points;
int a=1,b=1,c=1,dd=1;
boolean l=false,r=false,u=false,d=false;//ys=false,yx=false,zs=false,zx=false;
long st=System.currentTimeMillis();
while(true)
{
//每次转向如何连接节点?
//Count(point,l,r,u,d);//计算一个节点上下左右的值
CountDownLatch ch=new CountDownLatch(4);
TCount t=new TCount(point,l,r,u,d,ch);
t.start();
ch.await();
int i = cal(point.getU(), point.getD(), point.getL(), point.getR());//获得这个最大值,point.getYS(),point.getYX(),point.getZS(),point.getZX()
l=false;r=false;u=false;d=false;
if (point.getR() == i)
{
Point pointNext = new Point((point.getR() + point.getX()-1) , point.getY(), null);
addRPoint(point,pointNext);
point = pointNext;
l=true;
r=true;
a++;
} else
if (point.getL() == i)
{
Point pointNext = new Point((point.getX() - point.getL()+1), point.getY(), null);
addLPoint(point,pointNext);
point = pointNext;
r=true;
l=true;
b++;
} else
if (point.getU() == i)
{
Point pointNext = new Point(point.getX(), (point.getY() + point.getU()-1) , null);
addUPoint(point,pointNext);
point = pointNext;
d=true;
u=true;
c++;
} else
if (point.getD() == i)
{
Point pointNext = new Point(point.getX(), (point.getY() - point.getD()+1) , null);
addDPoint(point,pointNext);
point = pointNext;
u=true;
d=true;
dd++;
}
if (Math.abs(point.getX()-pointe.getX())<3)
{
flag = true;
break;
}
long et=System.currentTimeMillis();
if((et-st)>10000){
getPath(point);
System.out.println("寻路超时 a:"+a+"b:"+b+"c:"+c+"d:"+dd);
break ;
}
}
if (flag)
getPath(point);
}
public static void addRPoint(Point point, Point point1)
{
if (point.getX() == point1.getX() && point.getY() == point1.getY())
{
point1.setparPoint(point);
return;
} else
{
Point point2 = new Point(point1.getX() - 1, point1.getY(), null);
point1.setparPoint(point2);
addRPoint(point, point2);
}
}
public void addLPoint(Point point, Point point1)
{
lt++;
//if(lt>1000){System.out.println("往右卡死");return;}
if (point.getX() == point1.getX() && point.getY() == point1.getY())
{
point1.setparPoint(point);
return;
} else
{
Point point2 = new Point(point1.getX() + 1, point1.getY(), null);
point1.setparPoint(point2);
addLPoint(point, point2);
}
}
public void addUPoint(Point point, Point point1)
{
up1++;
//if(up1>1000){System.out.println("往下卡死");return;}
if (point.getX() == point1.getX() && point.getY() == point1.getY())
{
point1.setparPoint(point);
return;
} else
{
Point point2 = new Point(point1.getX(), point1.getY() - 1, null);
point1.setparPoint(point2);
addUPoint(point,point2);
}
}
public void addDPoint(Point point, Point point1)
{
down1++;
//if(down1>1000){ System.out.println("往上卡死");return;}
if (point.getX() == point1.getX() && point.getY() == point1.getY())
{
point1.setparPoint(point);
return;
} else
{
Point point2 = new Point(point1.getX(), point1.getY() + 1, null);
point1.setparPoint(point2);
addDPoint(point, point2);
}
}
class TCount extends Thread{
Point point;
boolean l;boolean r;boolean u;boolean d;
CountDownLatch cc;
TCount(Point point,boolean l,boolean r,boolean u,boolean d,CountDownLatch cc){
this.point=point;this.l=l;this.r=r;this.u=u;this.d=d;this.cc=cc;
}
public void run(){
ExecutorService exec=Executors.newCachedThreadPool();
exec.execute(new SSS(point,u,d,cc));
exec.execute(new XXX(point,u,d,cc));
exec.execute(new RRR(point,l,r,cc));
exec.execute(new LLL(point,l,r,cc));
}
}
class SSS implements Runnable{
Point p;boolean ss;boolean xx;CountDownLatch ch;
SSS(Point p,boolean ss,boolean xx,CountDownLatch cc){this.p=p;this.ss=ss;this.xx=xx;this.ch=cc;}
public void run(){
int i = p.getX();
int j = p.getY();
int s=0;
for(;map[i][j+s]!=0&&j+s<map_Height-1;s++);
if(!ss||!xx)
p.setU(s);
else
p.setU(0);
ch.countDown();
}
}
class XXX implements Runnable{
Point p;boolean ss;boolean xx;CountDownLatch ch;
XXX(Point p,boolean ss,boolean xx,CountDownLatch cc){this.ch=cc;this.p=p;this.ss=ss;this.xx=xx;}
public void run(){
int i = p.getX();
int j = p.getY();
int x=0;
for(;map[i][j-x]!=0&&j-x>1;x++);
if(!ss||!xx)
p.setD(x);
else
p.setD(0);
ch.countDown();
}
}
class RRR implements Runnable{
Point p;boolean ss;boolean xx;CountDownLatch ch;
RRR(Point p,boolean ss,boolean xx,CountDownLatch cc){this.ch=cc;this.p=p;this.ss=ss;this.xx=xx;}
public void run(){
int i = p.getX();
int j = p.getY();
int y=0;
for(;map[i+y][j]!=0&&i+y<map_Width-1;y++);
if(!ss||!xx)
p.setR(y);
else
p.setR(0);
ch.countDown();
}
}
class LLL implements Runnable{
Point p;boolean ss;boolean xx;CountDownLatch ch;
LLL(Point p,boolean ss,boolean xx,CountDownLatch cc){this.ch=cc;this.p=p;this.ss=ss;this.xx=xx;}
public void run(){
int i = p.getX();
int j = p.getY();
int z=0;
for(;map[i-z][j]!=0&&i-z>1;z++);
if(!ss||!xx)
p.setL(z);
else
p.setL(0);
ch.countDown();
}
}
public void Count(Point point,boolean l,boolean r,boolean u,boolean d)//boolean yous,boolean youx,boolean zuos,boolean zuox
{
int i = point.getX();
int j = point.getY();
if (map[i][j] == 0)
return;
int s = 0;
int x = 0;
int z = 0;
int y = 0;
for(;map[i+y][j]!=0&&i+y<map_Width-1;y++);
for(;map[i-z][j]!=0&&i-z>1;z++);
for(;map[i][j+s]!=0&&j+s<map_Height-1;s++);
for(;map[i][j-x]!=0&&j-x>1;x++);
if(!r)
point.setR(y);
else
point.setR(0);
if(!l)
point.setL(z);
else
point.setL(0);
if(!u)
point.setU(s);
else
point.setU(0);
if(!d)
point.setD(x);
else
point.setD(x);
}
public int cal(int i, int j, int k,int l)
{
int ai[] = new int[4];
ai[0] = i;
ai[1] = j;
ai[2] = k;
ai[3] = l;
//ai[4]=a;
//ai[5]=b;
//ai[6]=c;
//ai[7]=d;
Arrays.sort(ai);
int i1 = ai[3];
return i1;
}
public void getPath(Point point)
{
if (point.getparPoint() != null)
getPath(point.getparPoint());
resultList.add(point);
}
}
154
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
