Data Abstraction and Problem Solving with C++
Walls and Mirrors
by Frank M. Carrano
BFS.h
Go to the documentation of this file.00001 00018 #include <queue> 00019 #include "Graph.h" 00020 00021 using namespace std; 00022 00025 class BFS 00026 { 00027 protected: 00028 const Graph& g; 00029 00031 int count; 00032 00034 vector<int> mark; 00035 00037 vector<int> parents; 00038 00043 void search(Edge e); 00044 00045 public: 00050 BFS(const Graph& g); 00051 00056 void startSearch(); 00057 }; // end BFS 00058 // End of header file
