//这是dijkstra算法的伪代码，就是不能直接运行的代码 void dijkstra(Vertex s){ for each Vertex v { v.dist=INFINITY;v.known=false; } s.dist=0;for(;;) { Vertex v=smallest unknown distance vertex;if(v==NOT_A_VERTEX) break;v.known=true;for each Vertex w adjacent to v...
什么是伪代码，求实例
//这是dijkstra算法的伪代码，就是不能直接运行的代码
void
dijkstra(Vertex s){
for each Vertex
v {
v.dist=INFINITY;
v.known=false; }
s.dist=0;
for(;;) {
Vertex v=smallest unknown
distance vertex;
if(v==NOT_A_VERTEX) break;
v.known=true;
for each Vertex w adjacent to v
if(!w.known)
if(v.dist+cv,w<w.dist){
decrease(w.dist
to v.dist+cv,w);
w.path=v; }
}
}2014-01-04
