java 实现的一些算法： 赛选法求素数，最短路径（dijkstra，floyd），线段树，LCD，LCM-java implementation of a number of algorithms: tournament selection method Primes, the shortest path (dijkstra, floyd), segment tree, LCD, LCM

附件中的源码使用java实现了Dijkstra算法求最短路径-Java source code used in the annex to achieve the Dijkstra algorithm for the shortest path

任意给定图，10个结点以上，实现图，并用迪杰斯特拉算法求最短路径 注：在D盘存放节点之间的权值-Any given map, more than 10 nodes to achieve chart, and use Dijkstra shortest path algorithm