对于一个学校项目,他们要求我们制作dijkstra的算法。我有类:节点,边缘,图形和Dijkstra使用图形.get节点(返回列表),并将其存储在查找路径(在dikstra)中的局部变量中使用查找路径.java图形.java。
public List<Node> getNodes() {
return nodes;
}
public void findPath (Node s, Node d) {
System.out.println("nodeSize at begining of findpath : "+graph.getNodes().size());
List<Node> nodes = graph.getNodes();
dijkstraTable = new Map[nodes.size()];
//verify paramaters
if(!nodes.contains(s)) throw new InvalidParameterException("the source node is not valid");
if(!nodes.contains(d)) throw new InvalidParameterException("the destination node is not valid");
if(s == null || d == null ) throw new NullPointerException("s or d are null");
Edge edge0 = new Edge(s,s,0);
Map<Node,Edge> map = new HashMap<Node,Edge>();
map.put(s, edge0);
int i =0;
dijkstraTable[i] = map;
//iteration > 0
while(!nodes.isEmpty()) {
i++;
if (i==nodes.size()) break;
Map<Node,Edge> newMap = new HashMap<Node,Edge>();
map = dijkstraTable[i-1]; //last iteration map
//get minimum last iteration
Node min = getMinimum(map);
//mark it as "visited"
nodes.remove(min);
//add it to the path
}
输出是
节点查找路径开头的大小 : 7
节点循环中大小:6
节点循环中大小:5
节点循环中大小:5
节点循环中大小:5
节点查找路径末尾的大小 : 5
每次都应该是7分
慕工程0101907
猛跑小猪
互换的青春
随时随地看视频慕课网APP
相关分类