VeloGraphX
High-performance dynamic graph analytics in C++20
Loading...
Searching...
No Matches
velographx::incremental_detail Namespace Reference

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
 

Function Documentation

◆ propagate_dijkstra()

template<class NeighborEnumerator >
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().

◆ recompute_dijkstra()

template<class NeighborEnumerator >
void velographx::incremental_detail::recompute_dijkstra ( std::size_t  vertex_count,
VertexId  source,
std::vector< std::uint64_t > &  dist,
NeighborEnumerator &&  enumerate 
)

Variable Documentation

◆ kDijkstraInf

constexpr std::uint64_t velographx::incremental_detail::kDijkstraInf = std::numeric_limits<std::uint64_t>::max() / 4
inlineconstexpr

Definition at line 14 of file dijkstra.hpp.

Referenced by propagate_dijkstra(), and recompute_dijkstra().