dag_shortest_path.h File Reference

#include <cmath>
#include <functional>
#include <limits>
#include <vector>
#include "absl/algorithm/container.h"
#include "absl/log/check.h"
#include "absl/status/status.h"
#include "absl/strings/str_format.h"
#include "absl/types/span.h"
#include "ortools/base/logging.h"

Go to the source code of this file.

Classes
struct	operations_research::ArcWithLength
struct	operations_research::PathWithLength
class	operations_research::ShortestPathsOnDagWrapper< GraphType >
class	operations_research::KShortestPathsOnDagWrapper< GraphType >

Namespaces
namespace	operations_research
	In SWIG mode, we don't want anything besides these top-level includes.

Functions
PathWithLength	operations_research::ShortestPathsOnDag (const int num_nodes, absl::Span< const ArcWithLength > arcs_with_length, const int source, const int destination)
std::vector< PathWithLength >	operations_research::KShortestPathsOnDag (const int num_nodes, absl::Span< const ArcWithLength > arcs_with_length, const int source, const int destination, const int path_count)
template<class GraphType >
absl::Status	operations_research::TopologicalOrderIsValid (const GraphType &graph, absl::Span< const typename GraphType::NodeIndex > topological_order)
template<typename GraphType >
std::vector< typename GraphType::NodeIndex >	operations_research::NodePathImpliedBy (absl::Span< const typename GraphType::ArcIndex > arc_path, const GraphType &graph)
template<class GraphType >
void	operations_research::CheckNodeIsValid (typename GraphType::NodeIndex node, const GraphType &graph)