Changeset c4afdf3 for src/Fragmentation/Homology/HomologyGraph.hpp

Timestamp:

May 19, 2021, 7:06:29 PM (4 years ago)

Author:

Frederik Heber <frederik.heber@…>

Branches:

Candidate_v1.7.0, stable

Children:

15fc6a

Parents:

3f8238

git-author:

Frederik Heber <frederik.heber@…> (05/14/21 21:14:53)

git-committer:

Frederik Heber <frederik.heber@…> (05/19/21 19:06:29)

Message:

Extended BindingModel by comparators.

• this allows placing them in sorted STL containers.
• TEST: Added unit test.

File:

• src/Fragmentation/Homology/HomologyGraph.hpp (modified) (1 diff)

src/Fragmentation/Homology/HomologyGraph.hpp

@@ -127 +127 @@
   }
 
+  /** Checks whether this graph contains the given \a graph.
+   *
+   * Every edge must be present in this graph.
+   *
+   * \return true - graph is contained, false - else
+   */
+  bool contains(const HomologyGraph &graph) const {
+    for (edges_t::const_iterator iter = graph.edges.begin(); iter != graph.edges.end(); ++iter) {
+      edges_t::const_iterator finditer = edges.find(iter->first);
+      if (finditer == edges.end())
+        return false;
+      else if (finditer->second < iter->second)
+        return false;
+    }
+    return true;
+  }
+
   /** Checks whether this graph has \b exactly \a _times nodes with \a _number
    * atomic number.