contrib/mul/mbl/mbl_minimum_spanning_tree.h File Reference

Functions to compute minimum spanning trees from distance data. More...

#include <vnl/vnl_matrix.h>
#include <vgl/vgl_point_2d.h>
#include <vgl/vgl_point_3d.h>
#include <vcl_vector.h>
#include <vcl_utility.h>

Go to the source code of this file.

Functions
void	mbl_minimum_spanning_tree (const vnl_matrix< double > &D, vcl_vector< vcl_pair< int, int > > &pairs)
	Compute the minimum spanning tree given a distance matrix.
void	mbl_minimum_spanning_tree (const vcl_vector< vgl_point_2d< double > > &pts, vcl_vector< vcl_pair< int, int > > &pairs)
	Compute the minimum spanning tree of given points.
void	mbl_minimum_spanning_tree (const vcl_vector< vgl_point_3d< double > > &pts, vcl_vector< vcl_pair< int, int > > &pairs)
	Compute the minimum spanning tree of given points.

---

Detailed Description

Functions to compute minimum spanning trees from distance data.

Author:

Tim Cootes

Definition in file mbl_minimum_spanning_tree.h.

---

Function Documentation

void mbl_minimum_spanning_tree	(	const vnl_matrix< double > &	D,
		vcl_vector< vcl_pair< int, int > > &	pairs
	)

Compute the minimum spanning tree given a distance matrix.

Parameters:

pairs[0].first	is the root node Tree defined by pairs.
pairs[i].second	is linked to
pairs[i].first	We compute the minimum spanning tree of the graph using Prim's algorithm.

Definition at line 35 of file mbl_minimum_spanning_tree.cxx.

void mbl_minimum_spanning_tree	(	const vcl_vector< vgl_point_2d< double > > &	pts,
		vcl_vector< vcl_pair< int, int > > &	pairs
	)

Compute the minimum spanning tree of given points.

Parameters:

pairs[0].first	is the root node Tree defined by pairs.
pairs[i].second	is linked to
pairs[i].first	We compute the minimum spanning tree of the graph using Prim's algorithm.

Definition at line 66 of file mbl_minimum_spanning_tree.cxx.

void mbl_minimum_spanning_tree	(	const vcl_vector< vgl_point_3d< double > > &	pts,
		vcl_vector< vcl_pair< int, int > > &	pairs
	)

Compute the minimum spanning tree of given points.

Parameters:

pairs[0].first	is the root node Tree defined by pairs.
pairs[i].second	is linked to
pairs[i].first	We compute the minimum spanning tree of the graph using Prim's algorithm.

Definition at line 87 of file mbl_minimum_spanning_tree.cxx.