Simple CSR graph data structure that can take a custom C++ allocator and be stored in persistent memory This class uses vector containers to allocate internal arrays.
More...
#include </home/runner/work/metall/metall/example/graph_data_structure/csr_using_vector.hpp>
|
| | csr_using_vector (const std::size_t num_vertices, const std::size_t num_edges, allocator_t allocator=allocator_t()) |
| |
| index_t * | indices () |
| | Returns a raw pointer to the indices array. More...
|
| |
| vid_t * | edges () |
| | Returns a raw pointer to the edges array. More...
|
| |
template<typename index_t = uint64_t, typename vid_t = uint64_t, typename allocator_t = std::allocator<char>>
class csr_using_vector< index_t, vid_t, allocator_t >
Simple CSR graph data structure that can take a custom C++ allocator and be stored in persistent memory This class uses vector containers to allocate internal arrays.
- Template Parameters
-
| index_t | Index type |
| vid_t | Vertex ID type |
| allocator_t | Allocator type |
- Examples
- csr_graph.cpp.
◆ csr_using_vector()
template<typename index_t = uint64_t, typename vid_t = uint64_t, typename allocator_t = std::allocator<char>>
| csr_using_vector< index_t, vid_t, allocator_t >::csr_using_vector |
( |
const std::size_t |
num_vertices, |
|
|
const std::size_t |
num_edges, |
|
|
allocator_t |
allocator = allocator_t() |
|
) |
| |
|
inline |
◆ indices()
template<typename index_t = uint64_t, typename vid_t = uint64_t, typename allocator_t = std::allocator<char>>
Returns a raw pointer to the indices array.
◆ edges()
template<typename index_t = uint64_t, typename vid_t = uint64_t, typename allocator_t = std::allocator<char>>
Returns a raw pointer to the edges array.
The documentation for this class was generated from the following file:
1.9.1