bounded_dijkstra.h File Reference

#include <algorithm>
#include <cstddef>
#include <functional>
#include <limits>
#include <type_traits>
#include <utility>
#include <vector>
#include "absl/algorithm/container.h"
#include "absl/base/attributes.h"
#include "absl/log/check.h"
#include "absl/types/span.h"
#include "ortools/base/iterator_adaptors.h"
#include "ortools/base/strong_int.h"
#include "ortools/base/strong_vector.h"
#include "ortools/base/top_n.h"
#include "ortools/graph/graph.h"

Go to the source code of this file.

Classes
struct	operations_research::internal::is_strong_int< T >
struct	operations_research::internal::is_strong_int<::util_intops::StrongInt< Tag, Native, Validator > >
class	operations_research::internal::ElementGetter< T, ArcIndex >
class	operations_research::BoundedDijkstraWrapper< GraphType, DistanceType, ArcLengthFunctor >

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.

Typedefs
template<typename IndexType, typename ValueType>
using	operations_research::internal::IndexedVector

Functions
template<typename NodeIndex, typename DistanceType>
std::pair< DistanceType, std::vector< NodeIndex > >	operations_research::SimpleOneToOneShortestPath (NodeIndex source, NodeIndex destination, absl::Span< const NodeIndex > tails, absl::Span< const NodeIndex > heads, absl::Span< const DistanceType > lengths, DistanceType limit=std::numeric_limits< DistanceType >::max())