dominator_tree.hpp File Reference

#include <boost/config.hpp>
#include <deque>
#include <set>
#include <boost/graph/depth_first_search.hpp>
#include <boost/concept/assert.hpp>

Include dependency graph for dominator_tree.hpp:

Classes
class	boost::detail::time_stamper_with_vertex_vector< TimeMap, VertexVector, TimeT, Tag >
	An extended time_stamper which also records vertices for each dfs number. More...
class	boost::detail::dominator_visitor< Graph, IndexMap, TimeMap, PredMap, DomTreePredMap >

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

Functions
template<class TimeMap , class VertexVector , class TimeT , class Tag >
time_stamper_with_vertex_vector < TimeMap, VertexVector, TimeT, Tag >	boost::detail::stamp_times_with_vertex_vector (TimeMap timeMap, VertexVector &v, TimeT &t, Tag)
	A convenient way to create a time_stamper_with_vertex_vector. More...
template<class Graph , class IndexMap , class TimeMap , class PredMap , class VertexVector , class DomTreePredMap >
void	boost::lengauer_tarjan_dominator_tree_without_dfs (const Graph &g, const typename graph_traits< Graph >::vertex_descriptor &entry, const IndexMap &, TimeMap dfnumMap, PredMap parentMap, VertexVector &verticesByDFNum, DomTreePredMap domTreePredMap)
	Build dominator tree using Lengauer-Tarjan algorithm. More...
template<class Graph , class IndexMap , class TimeMap , class PredMap , class VertexVector , class DomTreePredMap >
void	boost::lengauer_tarjan_dominator_tree (const Graph &g, const typename graph_traits< Graph >::vertex_descriptor &entry, const IndexMap &indexMap, TimeMap dfnumMap, PredMap parentMap, VertexVector &verticesByDFNum, DomTreePredMap domTreePredMap)
	Unlike lengauer_tarjan_dominator_tree_without_dfs, dfs is run in this function and the result is written to dfnumMap, parentMap, vertices. More...
template<class Graph , class DomTreePredMap >
void	boost::lengauer_tarjan_dominator_tree (const Graph &g, const typename graph_traits< Graph >::vertex_descriptor &entry, DomTreePredMap domTreePredMap)
	Use vertex_index as IndexMap and make dfnumMap, parentMap, verticesByDFNum internally. More...
template<class Graph , class IndexMap , class DomTreePredMap >
void	boost::iterative_bit_vector_dominator_tree (const Graph &g, const typename graph_traits< Graph >::vertex_descriptor &entry, const IndexMap &indexMap, DomTreePredMap domTreePredMap)
	Muchnick. More...
template<class Graph , class DomTreePredMap >
void	boost::iterative_bit_vector_dominator_tree (const Graph &g, const typename graph_traits< Graph >::vertex_descriptor &entry, DomTreePredMap domTreePredMap)