0033算法笔记 - 分支限界法分支限界法与单源最短路径问题(3)

91. cout<

93. cout<

96. int v=1; 97. Graph G; 98. G.n=n; 99.

100. G.c=c; 101. G.dist=dist; 102. G.prev=prev; 103. G.ShortesPaths(v); 104.

105. cout<<\从S到T的最短路长是：\<

108. cout<<\<

111. for (int i = 2; i <= n; i++) 112. {

113. cout<<\从1到\<

116. for(int i=1;i<=n;i++) 117. {

118. delete []c[i]; 119. } 120.

121. delete []c; 122. c=0; 123. return 0; 124. }

程序运行结果如图：