boost Namespace Reference

Namespaces
namespace	concepts

Classes
class	binary_tree
	Binary tree base definition for further specialization. More...
class	binary_tree< false, Vertex >
	Forward Binary Tree. More...
class	binary_tree< true, Vertex >
	Bidirectional Binary Tree. More...

Typedefs
template<typename Vertex = std::size_t>
using	forward_binary_tree = binary_tree< false, Vertex >
	Forward Binary Tree alias.
template<typename Vertex = std::size_t>
using	bidirectional_binary_tree = binary_tree< true, Vertex >
	Bidirectional Binary Tree alias.
template<typename Graph >
using	vertex_descriptor_t = typename graph_traits< Graph >::vertex_descriptor

Enumerations
enum class	visit { pre , in , post }

Functions
template<typename Graph >
bool	empty (typename graph_traits< Graph >::vertex_descriptor u, Graph const &)
template<typename Vertex , typename DFSTreeVisitor >
void	depth_first_search (binary_tree< false, Vertex > &g, vertex_descriptor_t< binary_tree< false, Vertex > > s, DFSTreeVisitor &vis)
	performs a depth-first traversal of the vertices in a directed graph
template<typename Vertex , typename DFSTreeVisitor >
void	depth_first_search (binary_tree< false, Vertex > const &g, vertex_descriptor_t< binary_tree< false, Vertex > > s, DFSTreeVisitor &vis)
template<typename Vertex , typename DFSTreeVisitor >
void	depth_first_search (binary_tree< true, Vertex > &g, vertex_descriptor_t< binary_tree< true, Vertex > > s, DFSTreeVisitor &vis)
	performs a depth-first traversal of the vertices in a directed graph
template<typename Vertex , typename DFSTreeVisitor >
void	depth_first_search (binary_tree< true, Vertex > const &g, vertex_descriptor_t< binary_tree< true, Vertex > > s, DFSTreeVisitor &vis)
template<typename Vertex0 , typename Vertex1 >
bool	isomorphism (binary_tree< false, Vertex0 > const &g, binary_tree< false, Vertex1 > const &h)
	Detects if there is a 1-to-1 mapping of the vertices in one graph to the vertices of another graph such that adjacency is preserved.
template<typename Vertex0 , typename Vertex1 >
bool	isomorphism (binary_tree< true, Vertex0 > const &g, binary_tree< true, Vertex1 > const &h)
	Detects if there is a 1-to-1 mapping of the vertices in one graph to the vertices of another graph such that adjacency is preserved.

Detailed Description

• This program is free software; you can redistribute it and/or modify /// it under the terms of the GNU General Public License as published by /// the Free Software Foundation; either version 2 of the License, or /// (at your option) any later version. /// ///

Typedef Documentation

bidirectional_binary_tree

template<typename Vertex = std::size_t>

using boost::bidirectional_binary_tree = typedef binary_tree<true, Vertex>

Bidirectional Binary Tree alias.

Template Parameters

Vertex

forward_binary_tree

template<typename Vertex = std::size_t>

using boost::forward_binary_tree = typedef binary_tree<false, Vertex>

Forward Binary Tree alias.

Template Parameters

Vertex

Function Documentation

depth_first_search() [1/2]

template<typename Vertex , typename DFSTreeVisitor >

void boost::depth_first_search	(	binary_tree< false, Vertex > &	g,
		vertex_descriptor_t< binary_tree< false, Vertex > >	s,
		DFSTreeVisitor &	vis
	)

performs a depth-first traversal of the vertices in a directed graph

Template Parameters

Vertex
DFSTreeVisitor

Parameters

g	The binary tree graph
s	The vertex to start from
vis	The visitor to apply

depth_first_search() [2/2]

template<typename Vertex , typename DFSTreeVisitor >

void boost::depth_first_search	(	binary_tree< true, Vertex > &	g,
		vertex_descriptor_t< binary_tree< true, Vertex > >	s,
		DFSTreeVisitor &	vis
	)

performs a depth-first traversal of the vertices in a directed graph

Template Parameters

Vertex
DFSTreeVisitor

Parameters

g	The binary tree graph
s	The vertex to start from
vis	The visitor to apply

isomorphism() [1/2]

template<typename Vertex0 , typename Vertex1 >

bool boost::isomorphism	(	binary_tree< false, Vertex0 > const &	g,
		binary_tree< false, Vertex1 > const &	h
	)

Detects if there is a 1-to-1 mapping of the vertices in one graph to the vertices of another graph such that adjacency is preserved.

Template Parameters

Vertex0
Vertex1

Parameters

g	A binary tree graph
h	A binary tree graph

Returns

true if there exists an isomorphism between graph g and graph h and false otherwise

isomorphism() [2/2]

template<typename Vertex0 , typename Vertex1 >

bool boost::isomorphism	(	binary_tree< true, Vertex0 > const &	g,
		binary_tree< true, Vertex1 > const &	h
	)

Detects if there is a 1-to-1 mapping of the vertices in one graph to the vertices of another graph such that adjacency is preserved.

Template Parameters

Vertex0
Vertex1

Parameters

g	A binary tree graph
h	A binary tree graph

Returns

true if there exists an isomorphism between graph g and graph h and false otherwise