Changeset d83d64 for src/FunctionApproximation/Extractors.cpp

Timestamp:

Jun 21, 2018, 9:12:08 AM (7 years ago)

Author:

Frederik Heber <frederik.heber@…>

Children:

a951f3

Parents:

8d56a6

git-author:

Frederik Heber <frederik.heber@…> (09/26/17 22:30:01)

git-committer:

Frederik Heber <frederik.heber@…> (06/21/18 09:12:08)

Message:

Added Graph6Reader, extended BoostGraphCreator, added ChemicalSpaceEvaluatorAction.

• TESTS: due to new option "graph6" containing a digit we needed to modify moltest_check.py to also scan for digits and not just letters.

File:

• src/FunctionApproximation/Extractors.cpp (modified) (5 diffs)

src/FunctionApproximation/Extractors.cpp

@@ -67 +67 @@
 
 using namespace boost::assign;
+
+using namespace Extractors;
 
 FunctionModel::arguments_t
@@ -186 +188 @@
 }
 
-typedef size_t level_t;
-typedef size_t node_t;
-typedef std::multimap< level_t, node_t > nodes_per_level_t;
-typedef std::set<node_t> nodes_t;
-typedef std::set<nodes_t> set_of_nodes_t;
-typedef boost::property_map < boost::adjacency_list <>, boost::vertex_index_t >::type index_map_t;
-
-typedef boost::bimap<
-    boost::bimaps::set_of< size_t >,
-    boost::bimaps::multiset_of< Extractors::ParticleType_t >
-> type_index_lookup_t;
-
-typedef std::set<node_t> set_type;
-typedef std::set<set_type> powerset_type;
-
-typedef boost::adjacency_list < boost::vecS, boost::vecS, boost::undirectedS,
-    boost::no_property, boost::no_property > UndirectedGraph;
-typedef boost::subgraph< UndirectedGraph > UndirectedSubgraph;
-
-typedef std::map< node_t, std::pair<Extractors::ParticleType_t, size_t> > node_FragmentNode_map_t;
-
-typedef std::map< argument_t::indices_t, size_t> argument_placement_map_t;
-
-typedef std::map<size_t, size_t> argindex_to_nodeindex_t;
-
 void insertIntoNodeFragmentMap(
     node_FragmentNode_map_t &_node_FragmentNode_map,
@@ -334 +311 @@
  * \param index_map with indices per \a graph' vertex
  */
-static void generateAllInducedConnectedSubgraphs(
+void generateAllInducedConnectedSubgraphs(
     const size_t N,
     const level_t level,
@@ -438 +415 @@
 }
 
-static HomologyGraph createHomologyGraphFromNodes(
+HomologyGraph createHomologyGraphFromNodes(
     const nodes_t &nodes,
     const type_index_lookup_t &type_index_lookup,
@@ -501 +478 @@
 
   return HomologyGraph(graph_nodes, graph_edges);
-}
-
-/**
- * I have no idea why this is so complicated with BGL ...
- *
- * This is taken from the book "The Boost Graph Library: User Guide and Reference Manual, Portable Documents",
- * chapter "Basic Graph Algorithms", example on calculating the bacon number.
- */
-template <typename DistanceMap>
-class distance_recorder : public boost::default_bfs_visitor
-{
-public:
-  distance_recorder(DistanceMap dist) : d(dist) {}
-
-  template <typename Edge, typename Graph>
-  void tree_edge(Edge e, const Graph &g) const {
-    typename boost::graph_traits<Graph>::vertex_descriptor u = source(e,g), v = target(e,g);
-    d[v] = d[u] + 1;
-  }
-
-private:
-  DistanceMap d;
-};
-
-template <typename DistanceMap>
-distance_recorder<DistanceMap> record_distance(DistanceMap d)
-{
-  return distance_recorder<DistanceMap>(d);
 }