C++ Reference: shortestpaths

Note: This documentation is automatically generated.

This file contains various shortest paths utilities.

Keywords: directed graph, cheapest path, shortest path, Dijkstra, spp.

Function	Type	Arguments	Comments
AStarShortestPath	Return type: bool Arguments: int node_count, int start_node, int end_node, std::function<int64_t(int, int)> graph, std::function<int64_t(int)> heuristic, int64_t disconnected_distance, std::vector<int>* nodes
BellmanFordShortestPath	Return type: bool Arguments: int node_count, int start_node, int end_node, std::function<int64_t(int, int)> graph, int64_t disconnected_distance, std::vector<int>* nodes
DijkstraShortestPath	Return type: bool Arguments: int node_count, int start_node, int end_node, std::function<int64_t(int, int)> graph, int64_t disconnected_distance, std::vector<int>* nodes
StableDijkstraShortestPath	Return type: bool Arguments: int node_count, int start_node, int end_node, std::function<int64_t(int, int)> graph, int64_t disconnected_distance, std::vector<int>* nodes