Google OR-Tools v9.11
a fast and portable software suite for combinatorial optimization
|
#include "ortools/graph/dag_constrained_shortest_path.h"
#include <vector>
#include "absl/log/check.h"
#include "absl/status/statusor.h"
#include "absl/types/span.h"
#include "ortools/graph/dag_shortest_path.h"
#include "ortools/graph/graph.h"
#include "ortools/graph/topologicalsorter.h"
Go to the source code of this file.
Namespaces | |
namespace | operations_research |
In SWIG mode, we don't want anything besides these top-level includes. | |
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) |
std::vector< int > | operations_research::GetInversePermutation (absl::Span< const int > permutation) |