从固定点开始遍历图的所有生成树

struct Edge { int u, v, eid; };
struct Graph {
	int  m_vn;
	vector<Edge> m_edges;
	vector<vector<int>> m_adj_list;
	vector<int> m_vert_depth;
	vector<int> m_select_tree_edges;
	vector<int> m_candi_edges;

	Graph() { m_vn = 0; }
	Graph(int _n, vector<pair<int, int>> edges){
		m_vn = _n;
		m_adj_list.resize(_n);
		m_vert_depth.resize(_n, 0);
		for (auto e : edges) 
			AddEdge(e.first, e.second);
	}

	void AddEdge(int u, int v) {
		int eid = m_edges.size();
		m_adj_list[u].push_back(eid);
		m_edges.push_back({ u,v,eid });
	}

	void SelectEdge(int selected_vid, int start) {
		if (m_select_tree_edges.size() == m_vn-1) {
			cout << "tree edges:=================================" << endl;
			for (int eid : m_select_tree_edges)
				cout << m_edges[eid].u << "->" << m_edges[eid].v << endl;
			return;
		}
		//expand the candidate edges from selcted vertex's adj verts
		int from = m_candi_edges.size();
		for (int& eid : m_adj_list[selected_vid])
			if (!m_vert_depth[m_edges[eid].v])
				m_candi_edges.push_back(eid);

		//select an edge from the candidate set
		for (int k = start; k < m_candi_edges.size(); ++k) {
			Edge& e = m_edges[m_candi_edges[k]];
			if (!m_vert_depth[e.v]) {
				m_select_tree_edges.push_back(m_candi_edges[k]);
				m_vert_depth[e.v] = m_vert_depth[e.u] + 1;
				SelectEdge(e.v, k + 1);
				m_vert_depth[e.v] = 0;
				m_select_tree_edges.pop_back();
			}
		}
		//when the edge(x,selected_vid) is removed, then remove its adj edges 
		m_candi_edges.erase(m_candi_edges.begin() + from, m_candi_edges.end());
	}

	void EnumAllSpanningTreeFrom(int root) {
		vector<int> cand_edges;
		m_vert_depth[root] = 1;
		SelectEdge(root,0);
	}
};