My Project
all_distance_sketch::SketchDijkstraCallBacks< T > Member List

This is the complete list of members for all_distance_sketch::SketchDijkstraCallBacks< T >, including all inherited members.

get_num_pruned_nodes() (defined in all_distance_sketch::SketchDijkstraCallBacks< T >)all_distance_sketch::SketchDijkstraCallBacks< T >inline
InitSketchDijkstraCallBacks(GraphSketch *graph_sketch) (defined in all_distance_sketch::SketchDijkstraCallBacks< T >)all_distance_sketch::SketchDijkstraCallBacks< T >inline
NodePopedFromHeap(int poped_node_id, const NodeIdDistanceData &heap_value) (defined in all_distance_sketch::SketchDijkstraCallBacks< T >)all_distance_sketch::SketchDijkstraCallBacks< T >inline
RelaxedPath(int node_id) (defined in all_distance_sketch::SketchDijkstraCallBacks< T >)all_distance_sketch::SketchDijkstraCallBacks< T >inline
set_multi_threaded_params(bool multi_threaded_run, thread::ModuloLock *lock) (defined in all_distance_sketch::SketchDijkstraCallBacks< T >)all_distance_sketch::SketchDijkstraCallBacks< T >inline
set_should_calculate_dijkstra_rank(bool should_calc) (defined in all_distance_sketch::SketchDijkstraCallBacks< T >)all_distance_sketch::SketchDijkstraCallBacks< T >inline
ShouldPrune(int visited_node_id, graph::EdgeWeight distance_from_source_to_visited_node) (defined in all_distance_sketch::SketchDijkstraCallBacks< T >)all_distance_sketch::SketchDijkstraCallBacks< T >inline
ShouldStop() (defined in all_distance_sketch::SketchDijkstraCallBacks< T >)all_distance_sketch::SketchDijkstraCallBacks< T >inline
Started(int source_node_id, graph::Graph< T > *graph) (defined in all_distance_sketch::SketchDijkstraCallBacks< T >)all_distance_sketch::SketchDijkstraCallBacks< T >inline