有向图深度优先与广度优先算法的C++实现

#include<iostream> #include<vector> #include<list> #include<queue> #include<string> using namespace std; void CreateGraph(vector <list<string>> &Graph) { list <string> tmp; string Content; Content = "

>>阅读原文<<