The optimization problem of constructing a K-edge-connected directed graph from any given directed graph by adding a minimum set of edges is studied.
本文研究了以最小边集扩充一个任意有向图为K边连通有向图这一优化问题。
The edge case that makes edit-in-place a real problem is adding a new entry to the list.
现场编辑成为一个实际问题的边缘情况是为列表添加一个新的条目，多数设计师采用其他习惯用法添加项目。
应用推荐