We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent abd07f9 commit a1cb054Copy full SHA for a1cb054
src/solver/cut_vertex.md
@@ -2,4 +2,6 @@
2
3
割点可以用于**快速**判断图中任意两个顶点之间的连通性.
4
5
+本章节所说的图不是指求解时以关卡状态为节点的有向图, 而是以地图上地板位置为节点的无向图.
6
+
7
Tarjan 算法.
0 commit comments