基本解释[数学]强边着色英汉例句双语例句The algorithm for the adjacent strong edge coloring of graphs is an NP-complete problem.图的邻强边着色算法是一个NP完全问题。strong edge-coloring更多例句词组短语短语list -strong edge-coloring 列表2 -strong edge coloring number 强边色数strong edge-coloring更多词组专业释义数学强边着色