reducedgraph.h

Go to the documentation of this file.

/*
 *            E
 *            Copyright 2009-2020 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_REDUCEDGRAPH_H
#define VOTCA_TOOLS_REDUCEDGRAPH_H
 
// Local VOTCA includes
#include "graph.h"
#include "reducededge.h"
 
namespace votca {
namespace tools {
 
class ReducedGraph : public Graph {
 private:
  std::unordered_map<Edge, std::vector<std::vector<Index>>> expanded_edges_;
 
  void init_(std::vector<ReducedEdge> reduced_edges,
             std::unordered_map<Index, GraphNode> nodes);
 
  // Junctions must be stored internally
  std::set<Index> junctions_;
 
 public:
  ReducedGraph() = default;
 
  ReducedGraph(std::vector<ReducedEdge> reduced_edges);
  ReducedGraph(std::vector<ReducedEdge> reduced_edges,
               std::unordered_map<Index, GraphNode> nodes);
 
  std::vector<std::vector<Edge>> expandEdge(const Edge& edge) const;
 
  Graph expandGraph() const;
 
  // std::vector<Index> getJunctions() const;
 
  std::vector<std::pair<Index, GraphNode>> getNodes(void) const override;
 
  std::vector<Index> getVerticesDegree(Index degree) const override;
 
  friend std::ostream& operator<<(std::ostream& os, const ReducedGraph graph);
};
 
}  // namespace tools
}  // namespace votca
#endif  // VOTCA_TOOLS_REDUCEDGRAPH_H