常見例句雙語例句The algorithm for the adjacent strong edge coloring of graphs is an NP-complete problem.圖的鄰強(qiáng)邊著色算法是一個(gè)NP完全問題。 返回 strong edge-coloring