C++队列优化的Bellmanford最短路算法（SPFA），使用C++实现的Queue improved Bellman-Ford单源最短路算法，在国内还被叫做SPFA。这个程序输入一个图，找到图中的一个点，这个点到最远点的长度最短。图使用邻接表保存。-Shortest path algorithm optimized Bellmanford C++ queue (SPFA), use the the achieve C++ Queue improved Bellman-Ford single-source shortest path algorithm, also known in the domestic SPFA. This program input on a graph, to find a point, the point to the farthest point of the length of the shortest. Figure adjacency table maintains.