指标1：minimum vertex-cut By a vertex-cut in a graph G,we mean a set U of vertices of G such that G-U is disconnected.A vertex-cut of minimum cardinality in G is called a minimum vertex- cut. 问题3： 你能据此解释：割点是什么？ Nonseparable graph;是什么？ 图的block是什么？指标1：minimum vertex-cut By a vertex-cut in a graph G, we mean a set U of vertices of G such that G - U is disconnected. A vertex-cut of minimum cardinality in G is called a minimum vertex￾cut. 问题3： 你能据此解释：割点是什么？ Nonseparable graph是什么？ 图的block是什么？