graph_access.hpp File Reference

#include <concepts>
#include <cstddef>
#include <cstdint>
#include <type_traits>
#include <utility>
#include "velographx/types.hpp"

Go to the source code of this file.

Namespaces
namespace	velographx
namespace	velographx::graph_access_detail

Concepts
concept	velographx::graph_access_detail::MemberVertexCount
concept	velographx::graph_access_detail::AdlVertexCount
concept	velographx::graph_access_detail::MemberDirected
concept	velographx::graph_access_detail::AdlDirected
concept	velographx::graph_access_detail::MemberVersion
concept	velographx::graph_access_detail::AdlVersion
concept	velographx::ReadableGraph
concept	velographx::MutableGraph

Functions
template<class T >
constexpr VertexId	velographx::graph_access_detail::neighbor_target (const T &value) noexcept
template<class T >
constexpr auto	velographx::graph_access_detail::neighbor_weight (const T &value) noexcept
template<ReadableGraph Graph>
constexpr std::size_t	velographx::vertex_count (const Graph &graph)
template<ReadableGraph Graph>
constexpr bool	velographx::is_directed (const Graph &graph)
template<MutableGraph Graph>
constexpr std::uint64_t	velographx::graph_version (const Graph &graph)
template<ReadableGraph Graph, class Fn >
void	velographx::for_each_neighbor (const Graph &graph, VertexId u, Fn &&fn)
template<ReadableGraph Graph, class Fn >
void	velographx::for_each_weighted_neighbor (const Graph &graph, VertexId u, Fn &&fn)
template<ReadableGraph Graph, class Fn >
void	velographx::for_each_in_neighbor (const Graph &graph, VertexId v, Fn &&fn)
template<ReadableGraph Graph>
std::size_t	velographx::neighbor_count (const Graph &graph, VertexId u)
template<ReadableGraph Graph>
bool	velographx::has_edge (const Graph &graph, VertexId u, VertexId v)
template<ReadableGraph Graph>
auto	velographx::edge_weight (const Graph &graph, VertexId u, VertexId v)
template<class Graph , class Batch >
void	velographx::apply_updates (Graph &graph, const Batch &batch)