摘要: 2007年10月12日 8:35:57
9、Our problem is to devise a program that can remember sufficient information about the pairs it has seen to be able to decide whether or not a new pair of objects is connected. Informally, we refer to the task of designing such a method as the connectivity problem. This problem arises in a number of important applications.
我們要設(shè)計一個程序,它能夠知道足夠的配對信息,以便決定新的配對能否是聯(lián)通的。非正式地,我們把設(shè)計這樣的方法稱為聯(lián)通問題。這個問題出現(xiàn)在很多重要的應(yīng)用中。
(看起來沒什么復(fù)雜的算法,是因為規(guī)模小,10個配對用人腦就能算出來。it possible for a human to
閱讀全文