graph_cut.h File Reference

#include <boost/graph/adjacency_list.hpp>
#include <boost/graph/boykov_kolmogorov_max_flow.hpp>
#include <boost/graph/graph_traits.hpp>
#include <boost/graph/one_bit_color_map.hpp>
#include <unordered_map>
#include <vector>
#include "util/logging.h"

Include dependency graph for graph_cut.h:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Classes
class	colmap::MinSTGraphCut< node_t, value_t >
struct	colmap::MinSTGraphCut< node_t, value_t >::Edge

Namespaces
	colmap

Functions
void	colmap::ComputeMinGraphCutStoerWagner (const std::vector< std::pair< int, int >> &edges, const std::vector< int > &weights, int *cut_weight, std::vector< char > *cut_labels)
std::unordered_map< int, int >	colmap::ComputeNormalizedMinGraphCut (const std::vector< std::pair< int, int >> &edges, const std::vector< int > &weights, const int num_parts)