hamiltonian_path.h File Reference

#include <stddef.h>
#include <algorithm>
#include <cmath>
#include <cstdint>
#include <limits>
#include <stack>
#include <type_traits>
#include <utility>
#include <vector>
#include "absl/log/check.h"
#include "absl/types/span.h"
#include "ortools/util/bitset.h"
#include "ortools/util/saturated_arithmetic.h"
#include "ortools/util/vector_or_function.h"

Go to the source code of this file.

Classes
class	operations_research::ElementIterator< Set >
class	operations_research::Set< Integer >
class	operations_research::SetRangeIterator< SetRange >
class	operations_research::SetRangeWithCardinality< Set >
class	operations_research::LatticeMemoryManager< Set, CostType >
class	operations_research::HamiltonianPathSolver< CostType, CostFunction >
class	operations_research::PruningHamiltonianSolver< CostType, CostFunction >

Namespaces
namespace	operations_research
	In SWIG mode, we don't want anything besides these top-level includes.

Typedefs
typedef int	operations_research::PathNodeIndex

Functions
template<typename CostType, typename CostFunction>
HamiltonianPathSolver< CostType, CostFunction >	operations_research::MakeHamiltonianPathSolver (int num_nodes, CostFunction cost)
	Utility function to simplify building a HamiltonianPathSolver from a functor.