Welcome！[Sign In] ！[Sign Up]！
Front-page it | Collect it | [中国-简体中文]
FAQ Fav
Location:
Search - Dijkstra shortestpath_dij

Search list

[AI-NN-PR] Dijkstra

Description: 用Dijkstra法求最短路径，有向图与无向图均可-void ShortestPath_DIJ( Node a ,Status i ,Status v0 ,Status*D ,Status*pre ) { int v,w,j,l=1 Status*final Status min final=(Status*)malloc( sizeof(Status)*i ) for(v=0 v<i v++) { final[v]=FALSE pre[v]=FALSE D[v]=a[v0][v] if(D[v]<10000) pre[v]=v0 }
Platform: | Size: 1024 | Author: 腾龙 | Hits:

[Other] ShortestPath_DIJ

Description: 迪杰斯特拉算法实现有向图的的最短路径并在图上表示-Dijkstra algorithm to FIG shortest path represented in FIG.
Platform: | Size: 417792 | Author: 汪丹 | Hits:

CodeBus www.codebus.net