filter_kruskal.h File Reference

#include <algorithm>
#include <cstddef>
#include <iterator>
#include <span>
#include <core/union_find.h>

Go to the source code of this file.

Namespaces
namespace	KI_MST
	Minimum spanning forest by Filter-Kruskal.

Functions
template<typename EDGE, typename LESS, typename ENDPOINTS, typename EMIT>
size_t	KI_MST::FilterKruskal (std::span< EDGE > aEdges, KI_UNION_FIND &aForest, LESS aLess, ENDPOINTS aEndpoints, EMIT aEmit)
	Build a minimum spanning forest over aEdges.

Variables
static constexpr size_t	KI_MST::KRUSKAL_THRESHOLD = 1024
	< Sort and scan a range of this size or smaller instead of splitting it again.