03 2015 档案

有权图的Floyed
摘要：public class Floyed { public final static int UNLIMITED = Integer.MAX_VALUE; public static int[][] caculate(final int[][] linkedMatrix) { ... 阅读全文
posted @ 2015-03-06 15:01 lihui1625 阅读(134) 评论(0) 推荐(0)
无权图的Warshall算法
摘要：Warshall算法 ：将无权图的连接矩阵转化为联通表。 public class Walshall { public static int[][] caculate(final int[][] linkedMatrix) { int M = linkedMatrix.lengt... 阅读全文
posted @ 2015-03-06 14:01 lihui1625 阅读(116) 评论(0) 推荐(0)
无权图的遍历
摘要：public class UnweightedGraph { private final List vertexes = new ArrayList(); private final Map> linkTable = new TreeMap>(); public List get... 阅读全文
posted @ 2015-03-06 13:17 lihui1625 阅读(154) 评论(0) 推荐(0)