TravelingSalesman.hpp File Reference

#include <algorithm>
#include <functional>
#include <random>
#include <utility>
#include <vector>
#include "wpi/math/geometry/Pose2d.hpp"
#include "wpi/math/linalg/EigenCore.hpp"
#include "wpi/math/optimization/SimulatedAnnealing.hpp"
#include "wpi/util/array.hpp"

Go to the source code of this file.

Classes
class	wpi::math::TravelingSalesman
	Given a list of poses, this class finds the shortest possible route that visits each pose exactly once and returns to the origin pose. More...

Namespaces
namespace	wpi
namespace	wpi::math