资 源 简 介
题 目 ：最短路由计算
题目描述：INTERNET中通过路由器在多个网络中进行数据报的转发，在研究路由问题的时候，可以把每一个路由器、局域网或者广域网都抽象为一个结点，每条链路则用带有方向的边表示，边上的权值表示相邻结点的代价值。于是可以根据最短路径算法得出最佳的路由表。
-Title: Calculation of the shortest route subject description: INTERNET by routers in a number of network datagram forwarding, routing problems in the study, they can each router, LAN or WAN are abstracted as a node point, each link is used with the express direction of the edge, the edge of the right to express the value of adjacent nodes in lieu of value. It could thus be the basis of the shortest path algorithm to draw the best routing table.
文 件 列 表
shortpath
作业
res
abcd
001.txt
CAboutLuYouSystem.aps
CAboutLuYouSystem.clw
CAboutLuYouSystem.cpp
CAboutLuYouSystem.dsp
CAboutLuYouSystem.dsw
CAboutLuYouSystem.h
CAboutLuYouSystem.ncb
CAboutLuYouSystem.opt
CAboutLuYouSystem.plg
CAboutLuYouSystem.rc
CAboutLuYouSystemDoc.cpp
CAboutLuYouSystemDoc.h
CAboutLuYouSystemView.cpp
CAboutLuYouSystemView.h
Dcheck.cpp
Dcheck.h
Dfile.cpp
Dfile.h
Dinput.cpp
Dinput.h
Dline.cpp
Dline.h
MainFrm.cpp
MainFrm.h
Note.cpp
Note.h
ReadMe.txt
Resource.h
StdAfx.cpp
StdAfx.h
