dag_shortest_path.cc File Reference

#include "ortools/graph/dag_shortest_path.h"
#include <limits>
#include <utility>
#include <vector>
#include "absl/log/check.h"
#include "absl/types/span.h"
#include "ortools/graph/ebert_graph.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::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)

Variable Documentation

arc_lengths

std::vector<double> arc_lengths

Definition at line 36 of file dag_shortest_path.cc.

graph

GraphType graph

Definition at line 35 of file dag_shortest_path.cc.

original_arc_indices

std::vector<ArcIndex> original_arc_indices

Definition at line 37 of file dag_shortest_path.cc.

topological_order

std::vector<NodeIndex> topological_order

Definition at line 38 of file dag_shortest_path.cc.