edge connected graph 边连通图
r-edge-connected r边连通
super edge connected 超边连通
minimally k-edge-connected 极小k边连通有向图
k-edge-connected augmentation k边连通扩充
maximally edge-connected graph 极大边连通图
Optimally super-edge-connected 最优超边连通性
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边连通有向图这一优化问题。
A gate is merely a message that is illustrated with one end connected to the sequence diagram's frame's edge and the other end connected to a lifeline.
一个门只是一个消息,图形表示为一端连接序列图的框架边缘,另一端连接到生命线。
Two vertices are said to be adjacent to one another if they are connected by a single edge.
如果两个顶点被同一条边连接,就称这两个顶点是邻接的。
应用推荐