FS.h 301 B

12345678910111213141516
  1. #pragma once
  2. #include "graph.h"
  3. class BFS
  4. {
  5. };
  6. class DFS {
  7. private:
  8. const Graph& graph;
  9. std::set<Node*> visited;
  10. bool connected(Node* begin, Node* end, int depth);
  11. public:
  12. DFS(const Graph& agraph) : graph(agraph) {}
  13. bool connected(Node* begin, Node* end);
  14. }