#include "graph.h"
#include "pointcloud.h"
#include <algorithm>
#include <memory>
#include <stack>
Go to the source code of this file.
|
void | create_edges (std::vector< Edge > &edges, const PointCloud &cloud, const std::vector< size_t > &cluster) |
|
void | create_adj (std::vector< std::vector< size_t >> &adj, const std::vector< Edge > edges) |
|
void | remove_edge (std::vector< Edge > &edges, double dmax) |
|
void | mst (const std::vector< Edge > &edges, std::vector< Edge > &mst_edges, size_t vcount) |
|
void | dfs_util (std::vector< size_t > &new_cluster, const size_t vertex, std::vector< bool > &visited, const std::vector< size_t > &cluster, const std::vector< std::vector< size_t >> &adj) |
|
void | max_step (std::vector< std::vector< size_t >> &new_clusters, const std::vector< size_t > &cluster, const PointCloud &cloud, double dmax, size_t min_size) |
|
◆ create_adj()
void create_adj |
( |
std::vector< std::vector< size_t >> & |
adj, |
|
|
const std::vector< Edge > |
edges |
|
) |
| |
◆ create_edges()
void create_edges |
( |
std::vector< Edge > & |
edges, |
|
|
const PointCloud & |
cloud, |
|
|
const std::vector< size_t > & |
cluster |
|
) |
| |
◆ dfs_util()
void dfs_util |
( |
std::vector< size_t > & |
new_cluster, |
|
|
const size_t |
vertex, |
|
|
std::vector< bool > & |
visited, |
|
|
const std::vector< size_t > & |
cluster, |
|
|
const std::vector< std::vector< size_t >> & |
adj |
|
) |
| |
◆ max_step()
void max_step |
( |
std::vector< std::vector< size_t >> & |
new_clusters, |
|
|
const std::vector< size_t > & |
cluster, |
|
|
const PointCloud & |
cloud, |
|
|
double |
dmax, |
|
|
size_t |
min_size |
|
) |
| |
◆ mst()
void mst |
( |
const std::vector< Edge > & |
edges, |
|
|
std::vector< Edge > & |
mst_edges, |
|
|
size_t |
vcount |
|
) |
| |
◆ remove_edge()
void remove_edge |
( |
std::vector< Edge > & |
edges, |
|
|
double |
dmax |
|
) |
| |