Ignore:
Timestamp:
Jul 5, 2017, 7:43:00 PM (8 years ago)
Author:
Frederik Heber <frederik.heber@…>
Branches:
ForceAnnealing_oldresults, IndependentFragmentGrids_IntegrationTest
Children:
6e1c14
Parents:
41eed2
git-author:
Frederik Heber <frederik.heber@…> (05/19/17 09:27:11)
git-committer:
Frederik Heber <frederik.heber@…> (07/05/17 19:43:00)
Message:

Extended BreadthFirstSearchGatherer to allow BFS with limited discovery horizon.

  • TESTS: extended unit test as well.
File:
1 edited

Legend:

Unmodified
Added
Removed
  • src/Graph/BreadthFirstSearchGatherer.hpp

    r41eed2 r9b5fa6  
    3535  /** Discovers all nodes from the given \a _discoverfrom and returns
    3636   * the vector of ids.
     37   *
     38   * \param _discoverfrom node to start BFS from
     39   * \param _max_distance max distance to discover (negative means all)
    3740   */
    38   std::vector<atomId_t> operator()(const atomId_t &_discoverfrom);
     41  std::vector<atomId_t> operator()(
     42      const atomId_t &_discoverfrom,
     43      const int &_max_distance = -1);
    3944
    4045private:
Note: See TracChangeset for help on using the changeset viewer.