设为首页 加入收藏

TOP

营救公主(Java实现A*算法解决迷宫问题) (五)
2014-11-24 11:07:16 】 浏览:370
Tags:营救 公主 Java 实现 算法 解决 迷宫 问题
eOfPrince()
{
return distanceOfPrince;
}

/**
* 获取花费的总开销
*/
public int getSpendTime()
{
return getCost() / STRAIGHT_DISTANCE;
}

@Override
public int hashCode()
{
final int prime = 31;
int result = 1;
result = prime * result
+ ((position == null) 0 : position.hashCode());
return result;
}

@Override
public boolean equals(Object obj)
{
if (this == obj)
return true;
if (obj == null)
return false;
if (getClass() != obj.getClass())
return false;
PositionWeight other = (PositionWeight) obj;
if (position == null)
{
if (other.position != null)
return false;
}
else
if (!position.equals(other.position))
return false;
return true;
}

@Override
public String toString()
{
return "PositionWeight [position=" + position + ", distanceOfPrince="
+ distanceOfPrince + ", distanceOfPrincess="
+ distanceOfPrincess + ", father=" + father.getPosition()
+ ", cost=" + cost + "]";
}

/**
* 设置到目标节点的距离
*/
private void countDistanceToTarget(PositionWeight target)
{
Position targetPosition = target.getPosition();
int distanceToTarget = getPosition()
.getDistanceOfTarget(targetPosition);
setDistanceOfPrincess(distanceToTarget);
}

private void setDistanceOfPrince(int distanceOfPrince)
{
this.distanceOfPrince = distanceOfPrince;
}

private int getDistanceOfPrincess()
{
return distanceOfPrincess;
}

private void setDistanceOfPrincess(int distanceOfPrincess)
{
this.distanceOfPrincess = distanceOfPrincess;
}

private void setFather(PositionWeight father)
{
this.father = father;
}

private void setCost(int cost)
{
this.cost = cost;
}
}
[java]
import java.util.ArrayList;
import java.util.List;

import javax.lang.model.element.UnknownElementException;

/**
* 迷宫地图
*
* 类名称:Maze 类描述: 创建人:dobuy
*
*/
public class MazeMap
{
/**
* 迷宫中的原点(0,0)
*/
private Position originPosition;

/**
* 迷宫中的最大边界点
*/
private Position edgePosition;

/**
* 王子的位置
*/
private Position princePosition;

/**
* 公主的位置
*/
private Position princessPosition;

/**
* 所有可达的位置集合(非墙壁)
*/
private List allReachablePositions;

public MazeMap()
{
allReachablePositions = new ArrayList();
originPosition = new Position(0, 0);
}

public boolean isOverEdge(Position position)
{
if (getOriginPosition().getX() > position.getX()
|| getOriginPosition().getY() > position.getY()
|| getEdgePosition().getX() < position.getX()
|| getEdgePosition().getY() < position.getY())
{
return true;
}
return false;
}

/**
* 判断是否是墙
*
*/
public boolean isWall(Position currentPosition)
{
if (isOverEdge(currentPosition) || isPrincess(currentPosition)
|| getPrincePosition().equals(currentPosition))
{
return false;
}

return !getAllReachablePositions().contains(currentPosition);
}

/**
* 判断当前位置是否是公主位置
*
*/
public boolean isPrincess(Position currentPosition)
{
return getPrincessPosition().equals(currentPosition);
}

/**
* 初始化迷宫地址(坐标转换成点对象),并解析出王子的位置和公主的位置
*
* @param mazeMap 二维坐标表示的迷宫地图
*
*/
public void initMazeMap(char[][] mazeM

首页 上一页 2 3 4 5 6 7 8 下一页 尾页 5/11/11
】【打印繁体】【投稿】【收藏】 【推荐】【举报】【评论】 【关闭】 【返回顶部
上一篇[小代码]如何捕获应用程序日志。 下一篇Java - 通过IP地址获取用户所在地

最新文章

热门文章

Hot 文章

Python

C 语言

C++基础

大数据基础

linux编程基础

C/C++面试题目