operations_research Namespace Reference

Classes
class	DenseDoublyLinkedList
class	DynamicPartition
class	MergingPartition
class	SimpleDynamicPartition
class	DynamicPermutation
class	GraphSymmetryFinder
class	KnapsackSolver
	This library solves knapsack problems. More...
struct	KnapsackAssignment
struct	KnapsackItem
class	KnapsackSearchNode
class	KnapsackSearchPath
class	KnapsackState
class	KnapsackPropagator
class	KnapsackCapacityPropagator
class	BaseKnapsackSolver
class	KnapsackGenericSolver
class	SparsePermutation

Typedefs
typedef KnapsackItem *	KnapsackItemPtr

Functions
std::vector< int >	CountTriangles (const ::util::StaticGraph< int, int > &graph, int max_degree)
void	LocalBfs (const ::util::StaticGraph< int, int > &graph, int source, int stop_after_num_nodes, std::vector< int > *visited, std::vector< int > *num_within_radius, std::vector< bool > *tmp_mask)
void	MinimizeLinearAssignment (const std::vector< std::vector< double > > &cost, absl::flat_hash_map< int, int > *direct_assignment, absl::flat_hash_map< int, int > *reverse_assignment)
void	MaximizeLinearAssignment (const std::vector< std::vector< double > > &cost, absl::flat_hash_map< int, int > *direct_assignment, absl::flat_hash_map< int, int > *reverse_assignment)

Typedef Documentation

KnapsackItemPtr

typedef KnapsackItem* KnapsackItemPtr

Definition at line 327 of file knapsack_solver.h.

Function Documentation

CountTriangles()

std::vector<int> operations_research::CountTriangles	(	const ::util::StaticGraph< int, int > &	graph,
		int	max_degree
	)

LocalBfs()

void operations_research::LocalBfs	(	const ::util::StaticGraph< int, int > &	graph,
		int	source,
		int	stop_after_num_nodes,
		std::vector< int > *	visited,
		std::vector< int > *	num_within_radius,
		std::vector< bool > *	tmp_mask
	)

MaximizeLinearAssignment()

void operations_research::MaximizeLinearAssignment	(	const std::vector< std::vector< double > > &	cost,
		absl::flat_hash_map< int, int > *	direct_assignment,
		absl::flat_hash_map< int, int > *	reverse_assignment
	)

MinimizeLinearAssignment()

void operations_research::MinimizeLinearAssignment	(	const std::vector< std::vector< double > > &	cost,
		absl::flat_hash_map< int, int > *	direct_assignment,
		absl::flat_hash_map< int, int > *	reverse_assignment
	)