bipartite.hpp File Reference

#include <utility>
#include <vector>
#include <exception>
#include <boost/graph/properties.hpp>
#include <boost/graph/adjacency_list.hpp>
#include <boost/graph/depth_first_search.hpp>
#include <boost/graph/one_bit_color_map.hpp>
#include <boost/bind.hpp>

Include dependency graph for bipartite.hpp:

Classes
struct	boost::detail::bipartite_visitor_error< Vertex >
	The bipartite_visitor_error is thrown if an edge cannot be colored. More...
struct	boost::detail::bipartition_colorize< PartitionMap >
	Functor which colors edges to be non-monochromatic. More...
struct	boost::detail::bipartition_check< PartitionMap >
	Functor which tests an edge to be monochromatic. More...

Namespaces
	boost
	Duration formatting facet for input.
	boost::detail

Functions
template<typename PartitionMap >
bipartition_colorize < PartitionMap >	boost::detail::colorize_bipartition (PartitionMap partition_map)
	Creates a bipartition_colorize functor which colors edges to be non-monochromatic. More...
template<typename PartitionMap >
bipartition_check< PartitionMap >	boost::detail::check_bipartition (PartitionMap partition_map)
	Creates a bipartition_check functor which raises an error if a monochromatic edge is found. More...
template<typename BiDirectionalIterator1 , typename BiDirectionalIterator2 >
std::pair < BiDirectionalIterator1, BiDirectionalIterator2 >	boost::detail::reverse_mismatch (std::pair< BiDirectionalIterator1, BiDirectionalIterator1 > sequence1, std::pair< BiDirectionalIterator2, BiDirectionalIterator2 > sequence2)
	Find the beginning of a common suffix of two sequences. More...
template<typename Graph , typename IndexMap , typename PartitionMap >
bool	boost::is_bipartite (const Graph &graph, const IndexMap index_map, PartitionMap partition_map)
	Checks a given graph for bipartiteness and fills the given color map with white and black according to the bipartition. More...
template<typename Graph , typename IndexMap >
bool	boost::is_bipartite (const Graph &graph, const IndexMap index_map)
	Checks a given graph for bipartiteness. More...
template<typename Graph >
bool	boost::is_bipartite (const Graph &graph)
	Checks a given graph for bipartiteness. More...
template<typename Graph , typename IndexMap , typename PartitionMap , typename OutputIterator >
OutputIterator	boost::find_odd_cycle (const Graph &graph, const IndexMap index_map, PartitionMap partition_map, OutputIterator result)
	Checks a given graph for bipartiteness and fills a given color map with white and black according to the bipartition. More...
template<typename Graph , typename IndexMap , typename OutputIterator >
OutputIterator	boost::find_odd_cycle (const Graph &graph, const IndexMap index_map, OutputIterator result)
	Checks a given graph for bipartiteness. More...
template<typename Graph , typename OutputIterator >
OutputIterator	boost::find_odd_cycle (const Graph &graph, OutputIterator result)
	Checks a given graph for bipartiteness. More...