摘要：最近公共祖先问题~还有O(n)-O(1)的算法，再研究吧 整体用了递归、集合、分类等思想，可以去网上搜某牛的资料，黑书也不错 Code：Program LCA_tarjan;var n,i,u,v:longint; LCA :array[1..1000,1..1000] of longint; c :array[1..1000,0..1000] of longint; fa :array[1..... 阅读全文

摘要： 阅读全文

摘要：无向图:割顶：Program gedian; var n,m,time,x,y,sum,t,i :longint; link,next,endv,dfn,low :array[1..10000] of longint; b :array[1..10000] of boolean; Procedure insert(u,v:longint); begin inc(t); end... 阅读全文