图论的各种算法，包括最短路 最大流等，代码都在里面-A variety of graph theory algorithm code on the inside

实现这个算法需要如下的信息，首先算法要有己形成的多播路由树T 到所有目的节点的最短路信息，为此算法采用一个树组TD 记录已形成的多播路由树到每一个目的节点的最短路消息-The realization of this algorithm needs the following information, first of all algorithms have been formed by multicast routing tree T for all purposes to the most s

这是计算机网络中的迪杰斯特啦的最短路由算法演示程序，很好用啊-This is a computer network in the shortest you迪杰斯特routing algorithm demo program, with very good ah ... ...