vbl_graph_partition.h File Reference

Partitions a graph into disjoint connected components. More...

#include <vector>
#include <vbl/vbl_disjoint_sets.h>
#include <vbl/vbl_edge.h>
#include <vil/vil_image_view.h>

Go to the source code of this file.

Functions
void	vbl_graph_partition (vbl_disjoint_sets &ds, std::vector< vbl_edge > &edges, float t)
	t is a constant that determines the threshold on edge weight to form disconnected sets More...

Detailed Description

Partitions a graph into disjoint connected components.

Author

J. Mundy

Date

February 14, 2013

Adapted from the paper and code by Pedro Felzenszwalb International Journal of Computer Vision, Vol. 59, No. 2, September 2004 The graph is represented by a set of integer vertex ids and edges that are a pair of vertices. Each edge has an associated weight. Edges are sorted according to weight and then connected components are merged if the difference in internal component weights are greater than the smallest weight edge between a pair of adjacent components. The result is a set of isolated sub-graphs of the original graph.

Definition in file vbl_graph_partition.h.

Function Documentation

vbl_graph_partition()

void vbl_graph_partition	(	vbl_disjoint_sets &	ds,
		std::vector< vbl_edge > &	edges,
		float	t
	)

t is a constant that determines the threshold on edge weight to form disconnected sets

Definition at line 13 of file vbl_graph_partition.cxx.