Ignore:
Timestamp:
May 19, 2017, 2:28:43 PM (8 years ago)
Author:
Frederik Heber <frederik.heber@…>
Branches:
ForceAnnealing_goodresults, ForceAnnealing_tocheck
Children:
d07be9
Parents:
94791a
git-author:
Frederik Heber <frederik.heber@…> (05/19/17 14:28:28)
git-committer:
Frederik Heber <frederik.heber@…> (05/19/17 14:28:43)
Message:

tempcommit: BreadthFirstSearchGatherer::getDIstances() added.

File:
1 edited

Legend:

Unmodified
Added
Removed
  • src/Graph/BreadthFirstSearchGatherer.cpp

    r94791a r53ef16e  
    111111
    112112  // any node was discovered whose distances is less than num_vertices+1
     113  distance_map.clear();
    113114  const BoostGraphCreator::const_name_map_t name_map = boost::get(boost::vertex_name, BGgraph);
    114115  BoostGraphCreator::vertex_iter vp, vpend;
     
    117118    if (distances[v] != (num_vertices+1)) {
    118119      returnids.push_back( boost::get(name_map, v) );
     120      distance_map.insert( std::make_pair(boost::get(name_map, v), distances[v]) );
    119121    }
    120122  }
Note: See TracChangeset for help on using the changeset viewer.