首先因為要判斷是否符合圖的標準，當符合時就先讓最少的邊都先連到，然後再將多餘的邊放入，這樣就可以形圖一個基本的圖，而在產生圖的過程，我是分成兩個陣列做判斷，一個是已放一個是未放的方式來產生，最後再用push_back()來做串列，list我是list<int>::iterator it ，並且判斷開始begin() 和結束end()以防止出錯-To determine whether the first, because the standard map, when consistent with the least time to let the edges connected to the first, and then put the extra edge, so that you can form a basic chart diagram, and in the process of generating plans, I do judge divided into two arrays, one is not already put in place a way to generate, and finally then push_back () to do serial, list my list <int> :: Iterator it , and the judge began to begin () and the end of the end () to prevent errors