Ignore:
Timestamp:
May 19, 2017, 9:27:11 AM (8 years ago)
Author:
Frederik Heber <frederik.heber@…>
Branches:
ForceAnnealing_goodresults, ForceAnnealing_tocheck
Children:
adbeca
Parents:
6370f9
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

    r6370f9 r060fc3  
    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 (0 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 size_t &_max_distance = 0);
    3944
    4045private:
Note: See TracChangeset for help on using the changeset viewer.