If you download Boost, in this directory, boost/libs/graph/example, you'll find knights-tour.cpp. This may be what you're looking for.
Good lord, indeed! Thank you very much, Noel. -- Brian On Mon, Oct 19, 2009 at 8:53 AM, K. Noel Belcourt <kbelco@sandia.gov> wrote:
Hi Brian,
On Oct 18, 2009, at 11:17 PM, Brian Troutwine wrote:
The Knight's Tour Example given in Siek, Lee and Lumsdaine's book on the BGL will not compile due to a cyclical dependency between knight_adjacency_iterator and knights_tour_graph. Would someone help me to resolve this? This is the only implicit graph example given in the text and I would very much like to learn from it.
The text does not give a complete program, only a subset. I was unable to find a complete listing anywhere and have attached a version typed by myself to this email.
If you download Boost, in this directory, boost/libs/graph/example, you'll find knights-tour.cpp. This may be what you're looking for.
-- Noel
_______________________________________________ Boost-users mailing list Boost-users@lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users