Definition at line 25 of file bellman_ford.cc.
|
| | BellmanFord (int node_count, int start_node, std::function< int64_t(int, int)> graph, int64_t disconnected_distance) |
| |
| bool | ShortestPath (int end_node, std::vector< int > *nodes) |
| |
|
| static constexpr int64_t | kInfinity = std::numeric_limits<int64_t>::max() / 2 |
| |
◆ BellmanFord()
| BellmanFord |
( |
int |
node_count, |
|
|
int |
start_node, |
|
|
std::function< int64_t(int, int)> |
graph, |
|
|
int64_t |
disconnected_distance |
|
) |
| |
|
inline |
◆ ShortestPath()
| bool ShortestPath |
( |
int |
end_node, |
|
|
std::vector< int > * |
nodes |
|
) |
| |
◆ kInfinity
| constexpr int64_t kInfinity = std::numeric_limits<int64_t>::max() / 2 |
|
staticconstexpr |
The documentation for this class was generated from the following file: