dijkstra.hpp File Reference

#include <cstdint>
#include <functional>
#include <limits>
#include <queue>
#include <utility>
#include <vector>
#include "velographx/types.hpp"

Go to the source code of this file.

Namespaces
namespace	velographx
namespace	velographx::incremental_detail

Functions
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)
template<class NeighborEnumerator >
void	velographx::incremental_detail::recompute_dijkstra (std::size_t vertex_count, VertexId source, std::vector< std::uint64_t > &dist, NeighborEnumerator &&enumerate)

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