链式前向星

//链式前向星 类似于邻接表, 不同点 1.用下标代替指针 2.向前插入
const int MAXSIZE = 1e6 + 7;
struct Tail
{
	int to, next;
}tail[MAXSIZE];

int head[MAXSIZE] = {0}, tot = 0;
bool visit[MAXSIZE] = {0};

//head数组 相当于 尾巴节点的头指针(第一个)
//tail 是尾巴节点  next 指向 下一个尾巴 节点下标

void Add(int _head, int _tail) {
	//++tot 相当于 创建一个新节点, .to 记录尾巴节点
	tail[++tot].to = _tail;
	//head[_head] 相当于 邻接表里面的头指针 , 将新节点的 next 指向 头指针
	tail[tot].next = head[_head];
	//将头指针指向 新节点
	head[_head] = tot;
}


int main()
{
	int  n,m,start,over;
	while (cin >> n >>m) {
		tot = 0;
		memset(head, 0, sizeof(head));
		memset(tail, 0, sizeof(tail));
		memset(visit, 0, sizeof(visit));

		for (int i = 0; i < m; ++i) {
			cin >> start >> over;
			Add(start, over);
		}
		for (int i = 1; i <= n; i++)//n个起点
		{
			if(visit[i]) continue;
			visit[i] = true;
			cout << i <<" ";
			for (int j = head[i]; j; j = tail[j].next)//遍历以i为起点的边
			{
				if(visit[tail[j].to]) continue;
				visit[tail[j].to] = true;
				cout << tail[j].to << " ";
			}
		}
		cout << endl;
	}
	return 0;
}

#define HEAD(input) cf.head[input]
#define NEXT(input) cf.tail[input].nx
#define VALUE(input) cf.tail[input].v
#define TO(input) cf.tail[input].to

class ChainForward {
	struct ChainForwardNode {
		ChainForwardNode() :to(0), nx(0), v(0) {}
		int to,nx;
		long long v;
	};
public:
	ChainForward(int headLen, int edgeLen) {
		init(headLen, edgeLen);
	}
	void init(int headLen, int edgeLen) {
		head.assign(headLen, 0);
		tail.assign(edgeLen, {});
		tot = 1;
	}
	int add(int from,int to,int val) {
		tail[++tot].to = to;
		tail[tot].v = val;
		tail[tot].nx = head[from];
		head[from] = tot;
		return tot;
	}
	int tot;
	vector<int> head;
	vector<ChainForwardNode> tail;
};
//点数 和 边数 最大值
ChainForward cf(1000,10000);

void slove(){
	for (int i = HEAD(from); i; i = NEXT(i)) {
			if (VALUE(i) <= 0)continue;
			int to = TO(i);
	}
}