OR-Tools  8.2
BellmanFord

Detailed Description

Definition at line 23 of file bellman_ford.cc.

Public Member Functions

 BellmanFord (int node_count, int start_node, std::function< int64(int, int)> graph, int64 disconnected_distance)
 
bool ShortestPath (int end_node, std::vector< int > *nodes)
 

Static Public Attributes

static constexpr int64 kInfinity = kint64max / 2
 

Constructor & Destructor Documentation

◆ BellmanFord()

BellmanFord ( int  node_count,
int  start_node,
std::function< int64(int, int)>  graph,
int64  disconnected_distance 
)
inline

Definition at line 27 of file bellman_ford.cc.

Member Function Documentation

◆ ShortestPath()

bool ShortestPath ( int  end_node,
std::vector< int > *  nodes 
)

Definition at line 99 of file bellman_ford.cc.

Member Data Documentation

◆ kInfinity

constexpr int64 kInfinity = kint64max / 2
staticconstexpr

Definition at line 25 of file bellman_ford.cc.


The documentation for this class was generated from the following file: