摘要:
一、栈 /** * 自定义栈:后进先出 */ public class Stack<T> { private final int length=10; private final Object[] entry = new Object[length]; private int top = -1; / 阅读全文
摘要:
@Data @AllArgsConstructor @NoArgsConstructor public class Graph { private Set<String> nodes; private List<Pair<String, String>> table; public void rem 阅读全文
摘要:
图的连通性的概念: 连通无向图:如果无向图任意两个顶点都连通,则称为连通无向图连通有向图:如果有向图任意两个顶点vi,vj,从vi到vj和从vj到vi都有路径,则称有向图是强连通有向图 public class Connect { public static void main(String[] a 阅读全文