搜索结果: 1-1 共查到“世界文学史 Problem”相关记录1条 . 查询时间(0.287 秒)
star forest is a collection of vertex-disjoint trees of depth at most 1, and its size is the number of leaves in all its components. A spanning star forest of a given graph G is a spanning subgraph of...