#include <algorithm>
+using namespace std;
namespace lyx {
-using std::vector;
-using std::reverse;
-using std::fill;
-
int Graph::bfs_init(int s, bool clear_visited)
{
if (s < 0)
return s;
- Q_ = std::queue<int>();
+ Q_ = queue<int>();
if (clear_visited)
fill(visited_.begin(), visited_.end(), false);