|
VeloGraphX
High-performance dynamic graph analytics in C++20
|
Functions | |
| template<class NeighborEnumerator > | |
| void | propagate_dijkstra (std::vector< std::uint64_t > &dist, std::priority_queue< std::pair< std::uint64_t, VertexId >, std::vector< std::pair< std::uint64_t, VertexId > >, std::greater< std::pair< std::uint64_t, VertexId > > > &queue, NeighborEnumerator &&enumerate) |
| template<class NeighborEnumerator > | |
| void | recompute_dijkstra (std::size_t vertex_count, VertexId source, std::vector< std::uint64_t > &dist, NeighborEnumerator &&enumerate) |
Variables | |
| constexpr std::uint64_t | kDijkstraInf = std::numeric_limits<std::uint64_t>::max() / 4 |
| void velographx::incremental_detail::propagate_dijkstra | ( | std::vector< std::uint64_t > & | dist, |
| std::priority_queue< std::pair< std::uint64_t, VertexId >, std::vector< std::pair< std::uint64_t, VertexId > >, std::greater< std::pair< std::uint64_t, VertexId > > > & | queue, | ||
| NeighborEnumerator && | enumerate | ||
| ) |
Definition at line 17 of file dijkstra.hpp.
References kDijkstraInf.
Referenced by recompute_dijkstra().
| void velographx::incremental_detail::recompute_dijkstra | ( | std::size_t | vertex_count, |
| VertexId | source, | ||
| std::vector< std::uint64_t > & | dist, | ||
| NeighborEnumerator && | enumerate | ||
| ) |
Definition at line 38 of file dijkstra.hpp.
References kDijkstraInf, propagate_dijkstra(), and velographx::vertex_count().
Referenced by velographx::BasicIncrementalSSSP< Graph >::recompute(), and velographx::BasicIncrementalWeightedSSSP< Graph >::recompute().
|
inlineconstexpr |
Definition at line 14 of file dijkstra.hpp.
Referenced by propagate_dijkstra(), and recompute_dijkstra().