shortest_paths.cc File Reference

#include "ortools/graph/shortest_paths.h"
#include <algorithm>
#include <memory>
#include <utility>
#include <vector>
#include "absl/container/flat_hash_map.h"
#include "absl/functional/bind_front.h"
#include "absl/log/check.h"
#include "absl/types/span.h"
#include "ortools/base/adjustable_priority_queue-inl.h"
#include "ortools/base/adjustable_priority_queue.h"
#include "ortools/base/logging.h"
#include "ortools/base/map_util.h"
#include "ortools/base/stl_util.h"
#include "ortools/base/threadpool.h"
#include "ortools/base/timer.h"
#include "ortools/graph/ebert_graph.h"

Go to the source code of this file.

Classes
class	operations_research::PathContainerImpl

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

Functions
template<class GraphType >
void	operations_research::ComputeManyToManyShortestPathsWithMultipleThreadsInternal (const GraphType &graph, const std::vector< PathDistance > &arc_lengths, const std::vector< typename GraphType::NodeIndex > &sources, const std::vector< typename GraphType::NodeIndex > &destinations, int num_threads, PathContainer *const paths)
template<>
void	operations_research::ComputeManyToManyShortestPathsWithMultipleThreads (const ListGraph<> &graph, const std::vector< PathDistance > &arc_lengths, const std::vector< ListGraph<>::NodeIndex > &sources, const std::vector< ListGraph<>::NodeIndex > &destinations, int num_threads, PathContainer *const path_container)
template<>
void	operations_research::ComputeManyToManyShortestPathsWithMultipleThreads (const StaticGraph<> &graph, const std::vector< PathDistance > &arc_lengths, const std::vector< StaticGraph<>::NodeIndex > &sources, const std::vector< StaticGraph<>::NodeIndex > &destinations, int num_threads, PathContainer *const path_container)
template<>
void	operations_research::ComputeManyToManyShortestPathsWithMultipleThreads (const ReverseArcListGraph<> &graph, const std::vector< PathDistance > &arc_lengths, const std::vector< ReverseArcListGraph<>::NodeIndex > &sources, const std::vector< ReverseArcListGraph<>::NodeIndex > &destinations, int num_threads, PathContainer *const path_container)
template<>
void	operations_research::ComputeManyToManyShortestPathsWithMultipleThreads (const ReverseArcStaticGraph<> &graph, const std::vector< PathDistance > &arc_lengths, const std::vector< ReverseArcStaticGraph<>::NodeIndex > &sources, const std::vector< ReverseArcStaticGraph<>::NodeIndex > &destinations, int num_threads, PathContainer *const path_container)
template<>
void	operations_research::ComputeManyToManyShortestPathsWithMultipleThreads (const ReverseArcMixedGraph<> &graph, const std::vector< PathDistance > &arc_lengths, const std::vector< ReverseArcMixedGraph<>::NodeIndex > &sources, const std::vector< ReverseArcMixedGraph<>::NodeIndex > &destinations, int num_threads, PathContainer *const path_container)

Variable Documentation

reverse_destinations_

std::vector<int> reverse_destinations_

protected

Definition at line 257 of file shortest_paths.cc.

reverse_sources_

std::vector<int> reverse_sources_

protected

Definition at line 256 of file shortest_paths.cc.