/* * (有向)图的遍历算法模板 */ package dsa; public abstract class GraphTraverse { //常量 final static int UNDISCOVERED = 0;//尚未被发现的顶点 final static int DISCOVERED = 1;//已被发现的顶点 final static int VISITED = 2;//已访问过的顶点 final static int UNKNOWN = 0;//未知边 final stati
1076 Forwards on Weibo (30分)
题目链接
法一:邻接矩阵法
#include
#include
using namespace std;
const int maxn = 1010;
int Graph[maxn][maxn] = {0};
int n, l;
//邻接矩阵版本
struct Node{
int id;
int depth;
Node(int _id, int _depth):id(_id),depth(_depth){}
};
int bf