Boost logo

Boost Users :

Subject: [Boost-users] [Graph] Newbie on A*
From: Ken Kazinski (kjkazinski_at_[hidden])
Date: 2014-05-29 14:53:41


Sensei, I think a simple solution is to use a counter. int Count = 0; for(std::size_t v = source_node; ; v = p[v]) {     Count++;     if (Count > Distance)     {          break;     } }



Boost-users list run by williamkempf at hotmail.com, kalb at libertysoft.com, bjorn.karlsson at readsoft.com, gregod at cs.rpi.edu, wekempf at cox.net