D算法(Dijkstra,迪杰斯特拉算法)是典型的单源最短路径算法,用于计算一个节点到其他所有节点的最短路径。笔者将其应用于数字校园的建设中,以沈阳建筑大学为例,将校园实际道路网虚拟成网络图论中的网络图,利用VB语言实践D算法理论,并将查询结果高亮显示。 D algorithm (Dijkstra, Dijkstra algorithm) is a typical single-source shortest path algorithm for calculating the shortest path from one node to all the other nodes. The author applies it to the construction of digital campus. Taking Shenyang Jianzhu University as an example, this paper virtualizes the actual road network in the campus into a network diagram in network graph theory and applies VB algorithm to practice D algorithm theory, highlighting the query result.