Deprecated List

Namespace operations_research

Use the graph types in ///<util/graph instead.

Member operations_research::FlowQuantity

Global types for flow algorithms. Thes have been retired in favor of directly parameterizing those algorithms.

Member operations_research::HamiltonianPathSolver< CostType, CostFunction >::HamiltonianPath (std::vector< PathNodeIndex > *path)

API. Stores HamiltonianPath(BestHamiltonianPathEndNode()) into *path.

Member operations_research::HamiltonianPathSolver< CostType, CostFunction >::TravelingSalesmanPath (std::vector< PathNodeIndex > *path)

API.

Member operations_research::MPSolver::time_limit () const

Use TimeLimit() and SetTimeLimit(absl::Duration) instead.

Member operations_research::MPSolver::wall_time () const

Use DurationSinceConstruction() instead.

Member operations_research::NodeIndex

Global node and arc types for graphs. This have been retired in favor of parameterizing the graph types in ///<util/graph.

Member operations_research::PathNodeIndex

type.

Member operations_research::sat::NewIntegerVariableFromLiteral (Literal lit)

Member operations_research::Solver::wall_time () const

Use Now() instead. Time elapsed, in ms since the creation of the solver.

Class util::CompleteBipartiteGraph< NodeIndexType, ArcIndexType >::OutgoingArcIterator

interface.

Member util::DenseIntTopologicalSort (int num_nodes, const std::vector< std::pair< int, int > > &arcs, std::vector< int > *topological_order)

DenseInt[Stable]TopologicalSort[OrDie]. Kept here for legacy reasons, but most new users should use FastTopologicalSort():

• If your input is a list of edges, build you own StaticGraph<> (see ./graph.h) and pass it to FastTopologicalSort().
• If you need the "stable sort" bit, contact viger@ and/or or-core-team@ to see if they can create FastStableTopologicalSort().

Member util::FindCycleInDenseIntGraph (int num_nodes, const std::vector< std::pair< int, int > > &arcs)

Use util::graph::FindCycleInGraph() directly.