#include <pack.h>
Collaboration diagram for ML::Dbscan::AdjGraph::Pack< Index_ >:
Public Attributes | |
| Index_ * | vd |
| bool * | adj |
| Index_ * | adj_graph |
| Index_ | adjnnz |
| Index_ * | ex_scan |
| Index_ | N |
Member Data Documentation
◆ adj
template<typename Index_ = int>
| bool* ML::Dbscan::AdjGraph::Pack< Index_ >::adj |
the adjacency matrix
◆ adj_graph
template<typename Index_ = int>
| Index_* ML::Dbscan::AdjGraph::Pack< Index_ >::adj_graph |
the adjacency graph
◆ adjnnz
template<typename Index_ = int>
| Index_ ML::Dbscan::AdjGraph::Pack< Index_ >::adjnnz |
◆ ex_scan
template<typename Index_ = int>
| Index_* ML::Dbscan::AdjGraph::Pack< Index_ >::ex_scan |
exculusive scan generated from vd
◆ N
template<typename Index_ = int>
| Index_ ML::Dbscan::AdjGraph::Pack< Index_ >::N |
number of points in the dataset
◆ vd
template<typename Index_ = int>
| Index_* ML::Dbscan::AdjGraph::Pack< Index_ >::vd |
vertex degree array Last position is the sum of all elements in this array (excluding it) Hence, its length is one more than the number of poTypes
The documentation for this struct was generated from the following file:
- src/dbscan/adjgraph/pack.h
