Algorithm of all vertices-constrained shortest path
Sun Qiang · Jisuanji gongcheng yu sheji · 2008
An algorithm for all vertices-constrained shortest paths is put forward bases on some special data structures,such as inverse adjacency list and uses a minimum spanning tree and the pointer list that marks leaves of the trees.The theoretical analysis show that the efficiency of this algorithm is high,and is that it is very simple and very easy to be described,fulfilled and understood.And using a C program testifies its quality.