all_distance_sketch::DefaultDijkstraCallBacks< T > Class Template Reference

Public Member Functions
void	Started (int source_node_id, graph::Graph< T > *graph)
void	NodePopedFromHeap (int poped_node_id, const NodeIdDistanceData &heap_value)
bool	ShouldPrune (int visited_node_id, graph::EdgeWeight distance_from_source_to_visited_node)
bool	ShouldStop ()
void	RelaxedPath (int node_id)

---

The documentation for this class was generated from the following file:

• src/algorithms/dijkstra_shortest_paths.h