图论
文章平均质量分 87
Little_Match_Boy
这个作者很懒,什么都没留下…
展开
-
最小生成树(平面点无边)kurskal,prim+路径压缩
Ink on paperProblem DescriptionBob accidentally spilled some drops of ink on the paper. The initial position of the i-th drop of ink is(xi,yi), which expands outward by0.5centimeter per second, showing a circle.The curious Bob wants to know how lon...原创 2021-08-13 12:45:30 · 544 阅读 · 0 评论 -
图论 强(双)连通分量tarjan算法
强(双)连通分量tarjan算法这里挂两个题,第一个题求强联通分量,第二个题求割点先说一下tarjan的读法:ta ran(ta ren)( j 不发音)poj1144-Network(求割点)A Telephone Line Company (TLC) is establishing a new telephone cable network. They are connecting several places numbered by integers from 1 to N . No two原创 2021-07-21 13:43:32 · 410 阅读 · 0 评论