clique_covering_graph.hpp File Reference

#include <boost/config.hpp>
#include <boost/graph/adjacency_matrix.hpp>
#include <boost/graph/filtered_graph.hpp>
#include <boost/graph/graph_utility.hpp>
#include <boost/graph/graphviz.hpp>
#include <boost/graph/incremental_components.hpp>
#include <boost/graph/properties.hpp>
#include <boost/graph/topological_sort.hpp>
#include <boost/pending/disjoint_sets.hpp>
#include <boost/version.hpp>
#include "custom_map.hpp"
#include "custom_set.hpp"
#include "refcount.hpp"

Include dependency graph for clique_covering_graph.hpp:

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

Go to the source code of this file.

Data Structures
struct	cc_compatibility_graph_vertex_selector< Graph >
	Graph includes. More...
struct	cc_compatibility_graph_edge_selector< Graph >
	Predicate functor object used to select the proper set of edges. More...
struct	edge_compatibility_selector

Typedefs
using	boost_cc_compatibility_graph = boost::adjacency_matrix< boost::undirectedS, boost::property< boost::vertex_index_t, std::size_t >, edge_compatibility_selector >
	bulk compatibility graph More...
using	cc_compatibility_graph = boost::filtered_graph< boost_cc_compatibility_graph, cc_compatibility_graph_edge_selector< boost_cc_compatibility_graph >, cc_compatibility_graph_vertex_selector< boost_cc_compatibility_graph > >
	compatibility graph More...
using	cc_compatibility_graphRef = refcount< cc_compatibility_graph >
	refcount version of cc_compatibility_graph More...
using	C_vertex = boost::graph_traits< cc_compatibility_graph >::vertex_descriptor
	cc_compatibility_graph vertex More...
using	C_outEdgeIterator = boost::graph_traits< cc_compatibility_graph >::out_edge_iterator
using	VertexIndex = boost::graph_traits< boost_cc_compatibility_graph >::vertices_size_type
	vertices index type More...
using	vertex_index_pmap_t = boost::property_map< boost_cc_compatibility_graph, boost::vertex_index_t >::type
	index map type More...
using	rank_pmap_type = boost::iterator_property_map< std::vector< VertexIndex >::iterator, vertex_index_pmap_t >
	rank property map definition More...
using	pred_pmap_type = boost::iterator_property_map< std::vector< C_vertex >::iterator, vertex_index_pmap_t >
	parent property map definition More...
using	RVertexIndex = boost::graph_traits< boost_cc_compatibility_graph >::vertices_size_type
using	REdge = boost::graph_traits< boost_cc_compatibility_graph >::edge_descriptor
using	RDisjointSet = boost::disjoint_sets< rank_pmap_type, pred_pmap_type >

Detailed Description

Author

Stefano Bodini, Federico Badini

Definition in file clique_covering_graph.hpp.

Typedef Documentation

boost_cc_compatibility_graph

using boost_cc_compatibility_graph = boost::adjacency_matrix<boost::undirectedS, boost::property<boost::vertex_index_t, std::size_t>, edge_compatibility_selector>

bulk compatibility graph

Definition at line 159 of file clique_covering_graph.hpp.

C_outEdgeIterator

using C_outEdgeIterator = boost::graph_traits<cc_compatibility_graph>::out_edge_iterator

Definition at line 172 of file clique_covering_graph.hpp.

C_vertex

using C_vertex = boost::graph_traits<cc_compatibility_graph>::vertex_descriptor

cc_compatibility_graph vertex

Definition at line 171 of file clique_covering_graph.hpp.

cc_compatibility_graph

using cc_compatibility_graph = boost::filtered_graph<boost_cc_compatibility_graph, cc_compatibility_graph_edge_selector<boost_cc_compatibility_graph>, cc_compatibility_graph_vertex_selector<boost_cc_compatibility_graph> >

compatibility graph

Definition at line 165 of file clique_covering_graph.hpp.

cc_compatibility_graphRef

using cc_compatibility_graphRef = refcount<cc_compatibility_graph>

refcount version of cc_compatibility_graph

Definition at line 168 of file clique_covering_graph.hpp.

pred_pmap_type

using pred_pmap_type = boost::iterator_property_map<std::vector<C_vertex>::iterator, vertex_index_pmap_t>

parent property map definition

Definition at line 181 of file clique_covering_graph.hpp.

rank_pmap_type

using rank_pmap_type = boost::iterator_property_map<std::vector<VertexIndex>::iterator, vertex_index_pmap_t>

rank property map definition

Definition at line 179 of file clique_covering_graph.hpp.

RDisjointSet

using RDisjointSet = boost::disjoint_sets<rank_pmap_type, pred_pmap_type>

Definition at line 194 of file clique_covering_graph.hpp.

REdge

using REdge = boost::graph_traits<boost_cc_compatibility_graph>::edge_descriptor

Definition at line 186 of file clique_covering_graph.hpp.

RVertexIndex

using RVertexIndex = boost::graph_traits<boost_cc_compatibility_graph>::vertices_size_type

Definition at line 185 of file clique_covering_graph.hpp.

vertex_index_pmap_t

using vertex_index_pmap_t = boost::property_map<boost_cc_compatibility_graph, boost::vertex_index_t>::type

index map type

Definition at line 177 of file clique_covering_graph.hpp.

VertexIndex

using VertexIndex = boost::graph_traits<boost_cc_compatibility_graph>::vertices_size_type

vertices index type

Definition at line 175 of file clique_covering_graph.hpp.