Algorithm 算法：无向图的割点、桥与双连通分量 概念 对于无向图\(G\)，删除顶点\(v\)和其相连的边后\(G\)所包含的连通分量增多，则称\(v\)为关节点 (articulation point) 或割点 (cut point)。同理，删除边\(e\)和其相连的顶点后图包含的连通分量增多，则\(e\)是割边 (cut edge) 或桥 (bridge)。 割点形式化的定义：\(A\)是割点当且仅当存在两个点\(u,v\)，使得\

Algorithm Algorithm: An Application of Bitmap Data Structure 0x00: General Introduction Bitmap is a very useful data structure which is widely used in indexing, data compressing and other situations. It doesn't only demand little memory, but also has an optimized time

Algorithm Algorithm: Breadth-First Search Recall: Graphs Graph \(G = (V,E)\) \(V\) = set of vertices (arbitrary labels) \(E\) = set of edges, i.e., vertex pairs \((v,w)\) ordered pair \(\Rightarrow\) directed edge of graph unordered pair \(\Rightarrow\) undirected