black-and white graph
常見例句
- The black and white salesman problem(BWTSP) is a new NP-hard problem, which can be divided into the undirected BWTSP and the directed BWTSP according to the symmetry of edges in graph.
黑白旅行商問題(BWTSP)是近年來出現(xiàn)的新NP-難解問題,根據(jù)圖中邊是否對稱可以分爲(wèi)無曏BWTSP和有曏BWTSP兩種。 返回 black-and white graph