graph_bf_visitor.h 1.44 KB
Newer Older
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56
/*
 *            Copyright 2009-2018 The VOTCA Development Team
 *                       (http://www.votca.org)
 *
 *      Licensed under the Apache License, Version 2.0 (the "License")
 *
 * You may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 *              http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 *
 */

#ifndef __VOTCA_TOOLS_GRAPH_BF_VISITOR_H
#define __VOTCA_TOOLS_GRAPH_BF_VISITOR_H

#include <deque>
#include <queue>
#include <votca/tools/graphvisitor.h>

/**
 * \brief A breadth first (BF) graph visitor
 *
 * This graph visitor will explore the vertices closest to the starting node
 * first and proceed outwards.
 *
 */
namespace votca {
namespace tools {

class Graph;
class Edge;
class GraphNode;

class Graph_BF_Visitor : public GraphVisitor {
 private:
  std::deque<std::queue<Edge>> edge_que_;

  /// The core of the breadth first visitor is in how the edges are added
  /// to the queue in this function
  void addEdges_(Graph& g, int vertex);
  Edge getEdge_(Graph g);

 public:
  Graph_BF_Visitor(){};
  bool queEmpty();
};
}
}
#endif  // __VOTCA_TOOLS_GRAPH_BF_VISITOR_H