查找一个图中所有树算法.docxVIP

思路：1.??使用堆栈列出所有可能的支路，因为树中支路个数为n-1。2.??判断支路是否包含所有节点，包含则为树。?核心函数：/**?*?功能：获得图的所有树?*?参数：图的关联矩阵?*?返回：所有树的数组（以节点形式存放）?*/Matrix?GetAllTrees(const?Matrix?m){??Matrix?AllTrees;??vectorint?Branchs;???int?BranchNum?=?m[0].size();???//初始化可选支路堆栈??for?(int?i=0;im.size()-1;i++)??Branchs.push_back(i);???do??{??if(IsTree(m,Branchs))???//如果这些支路能构成树，添加到返回数组中??AllTrees.push_back(Branchs);??}?while?(GetNextBranch(Branchs,BranchNum));?//获得下一个可用支路，找不到则结束???return?AllTrees;}??程序源代码：#include?vector#include?iostream#include?algorithm#include?stack#include?assert.h#include?cstdiousing?namespace?std;?typedef?vectorvectorint ?Matrix;??Matrix?GetAssociatedMatrix(){??int?NoteNum,BranchNum;??cout节点个数：;??cinNoteNum;??cout支路个数：;??cinBranchNum;???Matrix?M(NoteNum);??for(Matrix::iterator?it?=?M.begin();it?!=?M.end() ; ++it)??(*it).resize(BranchNum);???int?NoteBegin,NoteEnd;??for?(int?j=0;jBranchNum;j++)??{??cout支路j+1：;??scanf(%d-%d,NoteBegin,NoteEnd);???assert(NoteBegin?=?NoteNum??NoteEnd?=?NoteNum??NoteBegin?= 0 ?NoteEnd?= 0);//check???M[NoteBegin-1][j] =?M[NoteEnd-1][j] = 1;??//fill??}???return?M;}?void?PrintAssociatedMatrix(const?Matrix?m){??coutendl关联矩阵为：endl;???for?(Matrix::size_type?i=0;im.size();i++)??{??for?(Matrix::size_type?j=0;jm[i].size();j++)??coutm[i][j]\t;??coutendl;??}}?bool?IsTree(const?Matrix?m,const?vectorint?Branchs){??vectorbool?flag(m.size());??fill(flag.begin(),flag.end(),false);??for(vectorbool::size_type?i=0;iBranchs.size();i++)??{??for?(Matrix::size_type?j=0;jm.size();j++)??{???if?(m[j][?Branchs[i] ] == 1)??flag[j]=?true;??}??}??for(vectorbool::size_type?j=0;jflag.size();j++)??{??if?(!flag[j])??return?false;??}??return?true;}?bool?NextBranch(vectorint?Branchs,int?MaxValue){??if(Branchs.empty())?return?false;??if?(Branchs.back() ?MaxValue)??{??Branchs.back()++;??return?true;??}??else??{??Branchs.pop_back();??return?NextBranch(Branchs,MaxValue-1);??}}?bool?GetNextBranch(vectorint?Branchs,?int?BranchNum){??int?BranchLength?=?Branchs.size();??int?MaxValue?=?BranchNum?- 1;??if(Ne