图的多种表示与遍历方法

邻接矩阵

用二维矩阵map表示图。注意：不存在的边要初始化为INF。
但邻接矩阵不方便表示重边或自环的情况，这时可以选择邻接表。

int n,m, a, b;
int main(){
	cin >> n >> m;
	//初始化二维矩阵
	for (int i = 1; i <= n; i++)
		for (int j = 1; j <= n; j++){
			if (i == j)map[i][j] = 0;
			else map[i][j] = 0xfff;
		}

	//读入边
	for (int i = 0; i < m; i++)
	{
		cin >> a >> b;
		map[a][b] = 1;
		map[b][a] = 1; //无向图
	}
	return 0;
}

DFS

int sum=0,book[100000];
void dfs(int cur)
{
	cout << cur << " ";
	sum++;
	if (sum == n)return;//所有的顶点已经访问过直接退出
	for (int i = 1; i <= n; i++)
	{
		//判断当前顶点cur到顶点i是否有边,并判断顶点i是否已经访问过
		if (map[cur][i]==1&& !book[i])
		{
			book[i] = 1;
			dfs(i);
		}
	}
	return;
}

BFS

void bfs(int cur) {
    queue<int> q;
    q.push(cur);
    book[cur] = 1;
    while (q.size()) {
        int tmp = q.front();
        cout << tmp << " ";
        q.pop();
        for (int i = 1; i <= n; i++) {
            if (!book[i] && map[tmp][i] == 1) {
                q.push(i);
                book[i] = 1;
            }
        }
    }
}

邻接表

用vector map来储存每个顶点相邻的顶点。

int n,m,u,v;
vector<vector<int>> map;

/*若边有权值
 struct edge{int to,cost;};
 vector<edge> map;
*/

int main() {
    cin >> n>>m;
    while (m--) {
        cin >> u >> v;
        map[u].push_back(v);
        map[v].push_back(u);
    }
    return 0;
}

DFS

int sum=0;
void dfs(int cur) {
    cout << cur << " ";
    sum++;
    if (sum == n)
        return;
    book[cur] = 1;
    for (auto i : map[cur]) {
        if (!book[i])
            dfs(i);
    }
}

BFS

void bfs(int cur) {
    queue<int> q;
    q.push(cur);
    book[cur] = 1;
    while (q.size()) {
        int tmp = q.front();
        cout << tmp << " ";
        q.pop();
        for (auto i : map[tmp]) {
            if (!book[i]) {
                q.push(i);
                book[i] = 1;
            }
        }
    }
}

拓展：图的其他表示

边集：

struct edge{
	int from,to;
	int w;
};