建立交通网络图的存储结构 解决单源最短路径问题(Dijkstra算法) 实现两个城市之间的最短路径的问题 用MFC实现可视化菜单界面，使操作更加人性化，包括启动界面、图标、背景、按钮、界面框架等设计-Established transportation network graph structure to solve the storage problem of single-source shortest path (Dijkstra algorithm) to achieve t

window graph 自动控制网络数据传输的带宽, 以动态库的形式提供接口(Window graph automatically control the bandwidth of the network data transmission, in the form of a dynamic library to provide the interface)