图的连通

在csdn中遇到的一道题：

M*N的矩阵，某些方块被设置标记，假设设置标记的方块存放1，没有设置标记的方块存放0
设定标记方块上下左右所在方块如果也被标记，可以和该标记块组成一个新的连接块
给出所有可能的连接块。

 

这道题的解法应该很多，一个最简单的方法就是：

找到一个1，遍历与之连接的点，记录并标记为走过。

再找下一个1，直到都为0或都为标记走过。

#include "stdafx.h" #include <list> #include <vector> #include <stack> #include "common.h" using namespace std; typedef struct Point { public: int x; int y; int value; }Point; void GetParts( list<Point> &partResult, vector<vector<int> > &a ,stack<Point> &StackP) { partResult.push_back(StackP.top()); a[StackP.top().x][StackP.top().y] = 0; while( !StackP.empty() ) { Point pt; int row = StackP.top().x; int col = StackP.top().y; StackP.pop(); if( row > 0 )//上 { if( a[row-1][col] > 0 ) { pt.x = row-1; pt.y = col; StackP.push(pt); partResult.push_back(pt); a[row-1][col] = 0; } } if( col > 0 )//左 { if( a[row][col-1] > 0 ) { pt.x = row; pt.y = col-1; StackP.push(pt); partResult.push_back(pt); a[row][col-1] = 0; } } if( col < int(a[0].size() - 1) )//右 { if( a[row][col+1] > 0 ) { pt.x = row; pt.y = col+1; StackP.push(pt); partResult.push_back(pt); a[row][col+1] = 0; } } if( row < int(a.size() - 1) )//下 { if( a[row+1][col] > 0 ) { pt.x = row + 1; pt.y = col; StackP.push(pt); partResult.push_back(pt); a[row+1][col] = 0; } } } }; int _tmain(int argc, _TCHAR* argv[]) { Point nowP; int a[6][6] = { { 0,1,0,1,0,0 }, { 1,1,0,1,1,0 }, { 0,1,1,1,0,1 }, { 0,0,0,0,0,0 }, { 1,1,0,1,1,1 }, { 1,1,0,1,0,0 } }; vector<vector<int> > arr = vector<vector<int> >(6,vector<int>(6)); for( int i = 0 ; i < 6; i++ ) { for( int j = 0; j < 6; j++ ) { arr[i][j] = a[i][j]; } } list<list<Point> > AllPart; list<Point> nowPart; stack<Point> PointStack; for( int i = 0; i < int(arr.size()); i ++ ) { for( int j = 0 ; j < int(arr[0].size()); j++ ) { if( arr[i][j] > 0 ) { nowPart.clear(); nowP.x = i; nowP.y = j; PointStack.push( nowP ); GetParts( nowPart, arr, PointStack); AllPart.push_back(nowPart); } } } //输出 list<list<Point> >::iterator itPart = AllPart.begin(); list<Point>::iterator itElem; for( ; itPart != AllPart.end(); ++itPart ) { itElem = itPart->begin(); cout<<"连通的据点:"<<endl; for( ; itElem != itPart->end(); ++itElem ) { cout<<"Point=("<<itElem->x<<","<<itElem->y<<") "; } cout<<endl; } return 0; }