#include "ortools/constraint_solver/routing_search.h"
#include <algorithm>
#include <cmath>
#include <cstdint>
#include <cstdlib>
#include <deque>
#include <functional>
#include <limits>
#include <map>
#include <memory>
#include <optional>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#include "absl/algorithm/container.h"
#include "absl/base/attributes.h"
#include "absl/container/flat_hash_map.h"
#include "absl/container/flat_hash_set.h"
#include "absl/flags/flag.h"
#include "absl/log/check.h"
#include "absl/log/die_if_null.h"
#include "absl/strings/str_cat.h"
#include "absl/strings/string_view.h"
#include "ortools/base/adjustable_priority_queue.h"
#include "ortools/base/logging.h"
#include "ortools/base/map_util.h"
#include "ortools/base/stl_util.h"
#include "ortools/base/types.h"
#include "ortools/constraint_solver/constraint_solver.h"
#include "ortools/constraint_solver/constraint_solveri.h"
#include "ortools/constraint_solver/routing.h"
#include "ortools/constraint_solver/routing_enums.pb.h"
#include "ortools/constraint_solver/routing_parameters.pb.h"
#include "ortools/constraint_solver/routing_types.h"
#include "ortools/constraint_solver/routing_utils.h"
#include "ortools/graph/christofides.h"
#include "ortools/util/bitset.h"
#include "ortools/util/range_query_function.h"
#include "ortools/util/saturated_arithmetic.h"

Classes
class	operations_research::GlobalCheapestInsertionFilteredHeuristic::NodeEntryQueue

struct	operations_research::GlobalCheapestInsertionFilteredHeuristic::NodeEntryQueue::Entry

class	operations_research::SavingsFilteredHeuristic::SavingsContainer< S >

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

Functions
	ABSL_FLAG (bool, routing_shift_insertion_cost_by_penalty, true, "Shift insertion costs by the penalty of the inserted node(s).")

	ABSL_FLAG (int64_t, sweep_sectors, 1, "The number of sectors the space is divided into before it is sweeped" " by the ray.")

FirstSolutionStrategy::Value	operations_research::AutomaticFirstSolutionStrategy (bool has_pickup_deliveries, bool has_node_precedences, bool has_single_vehicle_node)

std::vector< int64_t >	operations_research::ComputeVehicleEndChainStarts (const RoutingModel &model)

DecisionBuilder *	operations_research::MakeSweepDecisionBuilder (RoutingModel *model, bool check_assignment)

DecisionBuilder *	operations_research::MakeAllUnperformed (RoutingModel *model)
	Returns a DecisionBuilder making all nodes unperformed.

Function Documentation

◆ ABSL_FLAG() [1/2]

ABSL_FLAG	(	bool	,
		routing_shift_insertion_cost_by_penalty	,
		true	,
		"Shift insertion costs by the penalty of the inserted node(s)."	)

◆ ABSL_FLAG() [2/2]

ABSL_FLAG	(	int64_t	,
		sweep_sectors	,
		1	,
		"The number of sectors the space is divided into before it is sweeped" " by the ray."	)

Variable Documentation

◆ angle

double angle

Definition at line 4169 of file routing_search.cc.

◆ distance

double distance

Definition at line 4170 of file routing_search.cc.

◆ end_depot

int64_t end_depot

Definition at line 4249 of file routing_search.cc.

◆ head

int head

Definition at line 4423 of file routing_search.cc.

◆ index

int64_t index

Definition at line 4168 of file routing_search.cc.

◆ link

std::pair<int, int> link

Definition at line 4245 of file routing_search.cc.

◆ nodes

int nodes

Definition at line 4425 of file routing_search.cc.

◆ start_depot

int64_t start_depot

Definition at line 4248 of file routing_search.cc.

◆ tail

int tail

Definition at line 4424 of file routing_search.cc.

◆ value

int64_t value

Definition at line 4246 of file routing_search.cc.

◆ vehicle_class

int vehicle_class

Definition at line 4247 of file routing_search.cc.

Classes

Namespaces

Functions