Changeset 6e5907 for src/Graph/BoostGraphCreator.hpp

Timestamp:

Jul 5, 2017, 7:40:48 PM (8 years ago)

Author:

Frederik Heber <frederik.heber@…>

Branches:

ForceAnnealing_oldresults, IndependentFragmentGrids_IntegrationTest

Children:

89235ea

Parents:

6afd46

git-author:

Frederik Heber <frederik.heber@…> (05/18/17 17:45:47)

git-committer:

Frederik Heber <frederik.heber@…> (07/05/17 19:40:48)

Message:

Extracted extraction (subset of) nodes from BoostGraph into BreadthFirstSearchGatherer.

• also added helper namespace BoostGraphHelpers.
• we now treat the vertex indices and vertex names properly. Before that they had to coincide. Now, the name is the atomic id associated with the node and the index is the boost::graph internal index.

File:

• src/Graph/BoostGraphCreator.hpp (modified) (4 diffs)

src/Graph/BoostGraphCreator.hpp

@@ -15 +15 @@
 #endif
 
+#include <map>
 #include <vector>
 
 #include <boost/function.hpp>
 #include <boost/graph/adjacency_list.hpp>
+
+#include "types.hpp"
 
 class atom;
@@ -32 +35 @@
   //!> typedef for an undirected graph using boost::graph
   typedef boost::adjacency_list < boost::vecS, boost::vecS, boost::undirectedS,
-      boost::no_property, boost::no_property > UndirectedGraph;
+      boost::property<boost::vertex_name_t, atomId_t>, boost::no_property > UndirectedGraph;
   //!> typedef for a map of graph node indices
-  typedef boost::property_map < boost::adjacency_list <>, boost::vertex_index_t >::type index_map_t;
+  typedef boost::property_map < UndirectedGraph, boost::vertex_index_t >::type index_map_t;
+  typedef boost::property_map < UndirectedGraph, boost::vertex_index_t >::const_type const_index_map_t;
+  //!> typedef for a map of graph node indices
+  typedef boost::property_map < UndirectedGraph, boost::vertex_name_t >::type name_map_t;
+  typedef boost::property_map < UndirectedGraph, boost::vertex_name_t >::const_type const_name_map_t;
   //!> typedef for the  predicate to evaluate for adding the current edge or not
   typedef boost::function<bool (const bond &)> predicate_t;
+  //!> typedef for a Vertex
+  typedef boost::graph_traits<UndirectedGraph>::vertex_descriptor Vertex;
+  //!> typedef for vertex iterator
+  typedef boost::graph_traits<UndirectedGraph>::vertex_iterator vertex_iter;
 
+  //!> typedef for a node id
+  typedef size_t nodeId_t;
+  //!> typedef for map converting between node id in graph and the associated atomic id
+  typedef std::map<atomId_t, nodeId_t> atomids_nodeids_t;
 
   /** Creates the boost::graph using all atoms and bonds in the given \a _mol.
@@ -89 +104 @@
   }
 
+  /** Returns the node id to a given atom id \a _atomid.
+   *
+   * \param _atomid atom id
+   * \return node id
+   */
+  nodeId_t getNodeId(const atomId_t &_atomid) const;
+
 private:
   /** General purpose function that contains the internal logic of walking the
@@ -114 +136 @@
   //!> internal graph that is created by creator functions
   UndirectedGraph graph;
+  //!> external property map for all the atomic ids of each graph node
+  atomids_nodeids_t atomids_nodeids;
 };