#include <math.h>#include <stddef.h>#include <algorithm>#include <cmath>#include <limits>#include <memory>#include <stack>#include <type_traits>#include <utility>#include <vector>#include "ortools/base/integral_types.h"#include "ortools/base/logging.h"#include "ortools/util/bitset.h"#include "ortools/util/saturated_arithmetic.h"#include "ortools/util/vector_or_function.h"
Include dependency graph for hamiltonian_path.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 > |
| An iterator for sets of increasing corresponding values that have the same cardinality. More... | |
| class | operations_research::SetRangeWithCardinality< Set > |
| class | operations_research::LatticeMemoryManager< Set, CostType > |
| The Dynamic Programming (DP) algorithm memorizes the values f(set, node) for node in set, for all the subsets of cardinality <= max_card_. More... | |
| class | operations_research::HamiltonianPathSolver< CostType, CostFunction > |
| class | operations_research::PruningHamiltonianSolver< CostType, CostFunction > |
Namespaces | |
| operations_research | |
| Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. | |
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. More... | |