opencv2/geometry/mst.hpp#

#include <vector>

Include dependency graph for mst.hpp:

opencv2/geometry/mst.hpp Node1 opencv2/geometry/mst.hpp Node2 vector Node1->Node2

opencv2/geometry/mst.hpp Node1 opencv2/geometry/mst.hpp Node2 vector Node1->Node2

Classes#

struct cv::MSTEdge

Represents an edge in a graph for Minimum Spanning Tree (MST) computation. More…

Namespaces#

namespace cv

Enumerations#

enum cv::MSTAlgorithm {
MST_PRIM = 0,
MST_KRUSKAL = 1
}

Represents the algorithms available for building a Minimum Spanning Tree (MST). More…

Functions#

bool cv::buildMST (int numNodes, const std::vector< MSTEdge > &inputEdges, std::vector< MSTEdge > &resultingEdges, MSTAlgorithm algorithm, int root=0)

Builds a Minimum Spanning Tree (MST) using the specified algorithm (see MSTAlgorithm).