若要在n个城市之间建立通信网络，只需要架设n-1条线路即可。如何以最低的经济代价建设这个通信网，是一个网的最小生成树问题
To establish communication networks between n cities, only need to set up the n-1 lines can be. The lowest economic cost of construction communication network is a network of minimum spanning tree problem (2012-06-19, Visual Basic, 1KB, 下载10次)
dijkstra算法源代码，实现了dijkstra算法，并附有一个简单路网文件
dijkstra algorithm source code, to achieve the dijkstra algorithm, together with a simple network file (2009-04-18, Visual Basic, 4KB, 下载16次)
自行开发 水准网平差程序
Self-developed standard procedures for network adjustment (2008-05-30, Visual Basic, 83KB, 下载80次)
构建Delaunay三角网的VB源TriangleDevelopment
Construction of Delaunay Triangulation VB source TriangleDevelopment (2007-12-23, Visual Basic, 17KB, 下载23次)
vb实现的构建Delaunay三角网程序，算法效率高
vb achieve Construction procedures Delaunay triangulation algorithm efficiency (2006-08-31, Visual Basic, 15KB, 下载40次)