常见例句双语例句The algorithm for the adjacent strong edge coloring of graphs is an NP-complete problem.图的邻强边着色算法是一个NP完全问题。 返回 strong edge-coloring