Simple adjacency-list graph data structure that can take a custom C++ allocator and be stored in persistent memory.
More...
#include </home/runner/work/metall/metall/example/graph_data_structure/adjacency_list.hpp>
template<typename vid_t = uint64_t, typename allocator_t = std::allocator<char>>
class adjacency_list< vid_t, allocator_t >
Simple adjacency-list graph data structure that can take a custom C++ allocator and be stored in persistent memory.
- Template Parameters
-
vid_t | Vertex ID type |
allocator_t | Allocator type |
- Examples
- adjacency_list_graph.cpp.
◆ adjacency_list()
template<typename vid_t = uint64_t, typename allocator_t = std::allocator<char>>
◆ add_edge()
template<typename vid_t = uint64_t, typename allocator_t = std::allocator<char>>
void adjacency_list< vid_t, allocator_t >::add_edge |
( |
vid_t |
source, |
|
|
vid_t |
target |
|
) |
| |
|
inline |
◆ edges_begin()
template<typename vid_t = uint64_t, typename allocator_t = std::allocator<char>>
auto adjacency_list< vid_t, allocator_t >::edges_begin |
( |
const vid_t |
source | ) |
|
|
inline |
◆ edges_end()
template<typename vid_t = uint64_t, typename allocator_t = std::allocator<char>>
auto adjacency_list< vid_t, allocator_t >::edges_end |
( |
const vid_t |
source | ) |
|
|
inline |
The documentation for this class was generated from the following file: