dag_constrained_shortest_path.h File Reference

#include <cmath>
#include <limits>
#include <optional>
#include <vector>
#include "absl/algorithm/container.h"
#include "absl/base/log_severity.h"
#include "absl/log/check.h"
#include "absl/strings/str_format.h"
#include "absl/types/span.h"
#include "ortools/base/threadpool.h"
#include "ortools/graph/dag_shortest_path.h"
#include "ortools/graph/graph.h"

Go to the source code of this file.

Classes
struct	operations_research::ArcWithLengthAndResources
struct	operations_research::GraphPathWithLength< GraphType >
class	operations_research::ConstrainedShortestPathsOnDagWrapper< GraphType >

Namespaces
namespace	operations_research
	In SWIG mode, we don't want anything besides these top-level includes.
namespace	operations_research::internal
	End of the interface. Below is the implementation.

Functions
PathWithLength	operations_research::ConstrainedShortestPathsOnDag (const int num_nodes, absl::Span< const ArcWithLengthAndResources > arcs_with_length_and_resources, int source, int destination, const std::vector< double > &max_resources)
template<typename T>
std::vector< T >	operations_research::internal::GetInversePermutation (const std::vector< T > &permutation)