C++位运算实现离散Warshall算法

#include<iostream>
#include<vector>
using namespace std;
inline void SetBit(char& c, int n, int i)  //将char中的第n位bit设为i
{
	i ? c |= i << n : c &= ~(1 << n);
}
inline int GetBit(const char& c, int n) //提取出char中第n位的bit
{
	return (c >> n) & 1;
}
int main()
{
	int n, x;
	cin >> n;    //n阶方阵
	vector<char> v(n);
	for (int i = 0; i != n; ++i)     //输入矩阵
		for (int j = 0; j != n; ++j) {
			cin >> x;
			SetBit(v[i], j, x);
		}
	for (int i = 0; i != n; ++i)        //转换过程
		for (int j = 0; j != n; ++j) 
			if (GetBit(v[j], i)) 
				v[j] |= v[i];
	for (int i = 0; i != n; ++i) {       //输出矩阵
		for (int j = 0; j != n; ++j)
			cout << GetBit(v[i], j) << " ";
		cout << endl;
	}
	system("pause");
}

猜你喜欢

转载自blog.csdn.net/weixin_44009743/article/details/89076838