Changeset e3ec8a8 for src/Graph/unittests/BreadthFirstSearchGathererUnitTest.cpp

Timestamp:

Jul 12, 2017, 7:10:32 PM (8 years ago)

Author:

Frederik Heber <frederik.heber@…>

Branches:

Action_Thermostats, Adding_Graph_to_ChangeBondActions, Adding_MD_integration_tests, Adding_StructOpt_integration_tests, AutomationFragmentation_failures, Candidate_v1.6.1, ChemicalSpaceEvaluator, Enhanced_StructuralOptimization, Enhanced_StructuralOptimization_continued, Exclude_Hydrogens_annealWithBondGraph, Fix_Verbose_Codepatterns, ForceAnnealing_with_BondGraph, ForceAnnealing_with_BondGraph_continued, ForceAnnealing_with_BondGraph_continued_betteresults, ForceAnnealing_with_BondGraph_contraction-expansion, Gui_displays_atomic_force_velocity, JobMarket_RobustOnKillsSegFaults, JobMarket_StableWorkerPool, PythonUI_with_named_parameters, Recreated_GuiChecks, StoppableMakroAction, TremoloParser_IncreasedPrecision

Children:

966ce7

Parents:

0dc8bf2

git-author:

Frederik Heber <frederik.heber@…> (05/19/17 09:27:11)

git-committer:

Frederik Heber <frederik.heber@…> (07/12/17 19:10:32)

Message:

Extended BreadthFirstSearchGatherer to allow BFS with limited discovery horizon.

• TESTS: extended unit test as well.

File:

• src/Graph/unittests/BreadthFirstSearchGathererUnitTest.cpp (modified) (1 diff)

src/Graph/unittests/BreadthFirstSearchGathererUnitTest.cpp

@@ -105 +105 @@
   CPPUNIT_ASSERT_EQUAL (compareids, atomids);
 };
+
+/** Tests whether operator() with limited distance works.
+ */
+void BreadthFirstSearchGathererTest::limitedDistanceTest()
+{
+  // create linear test graph
+  prepareLinearGraph();
+
+  // call operator
+  BreadthFirstSearchGatherer gatherer(*BGCreator);
+  {
+    std::vector<atomId_t> atomids = gatherer(0, 3);
+
+    // create comparator set
+    std::vector<atomId_t> compareids;
+    compareids += 1,2,3,4;
+    CPPUNIT_ASSERT_EQUAL ((size_t)4, atomids.size());
+    CPPUNIT_ASSERT_EQUAL (compareids, atomids);
+  }
+  // zero distance means just find the initial node
+  {
+    std::vector<atomId_t> atomids = gatherer(0, 0);
+
+    // create comparator set
+    std::vector<atomId_t> compareids;
+    compareids += 1;
+    CPPUNIT_ASSERT_EQUAL ((size_t)1, atomids.size());
+    CPPUNIT_ASSERT_EQUAL (compareids, atomids);
+  }
+  // negative distance means find all
+  {
+    std::vector<atomId_t> atomids = gatherer(0, -1);
+
+    // create comparator set
+    std::vector<atomId_t> compareids;
+    compareids += 1,2,3,4,5;
+    CPPUNIT_ASSERT_EQUAL ((size_t)5, atomids.size());
+    CPPUNIT_ASSERT_EQUAL (compareids, atomids);
+  }
+};