or-tools/src/graph/shortestpaths.h File Reference

#include <string>
#include <vector>
#include "base/callback.h"
#include "base/integral_types.h"
#include "base/macros.h"
#include "base/scoped_ptr.h"

Go to the source code of this file.

Namespaces
namespace	operations_research
Functions
bool	operations_research::DijkstraShortestPath (int node_count, int start_node, int end_node, ResultCallback2< int64, int, int > *const graph, int64 disconnected_distance, std::vector< int > *nodes)
	Dijsktra Shortest path with callback based description of the graph.
bool	operations_research::BellmanFordShortestPath (int node_count, int start_node, int end_node, ResultCallback2< int64, int, int > *const graph, int64 disconnected_distance, std::vector< int > *nodes)
	Bellman-Ford Shortest path with callback-based description of the graph.