or-tools/src/graph/dijkstra.cc File Reference

#include "base/hash.h"
#include <vector>
#include "base/callback.h"
#include "base/integral_types.h"
#include "base/scoped_ptr.h"
#include "base/adjustable_priority_queue.h"

Go to the source code of this file.

Namespaces
namespace	operations_research
Classes
class	operations_research::DijkstraSP
	namespace More...
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.

---

Variable Documentation

int64 distance_

Definition at line 41 of file dijkstra.cc.

int heap_index_

Definition at line 40 of file dijkstra.cc.

int node_

Definition at line 42 of file dijkstra.cc.