gum::prm::gspan Namespace Reference

Classes
class	DFSCode
	Reprensent a Depth First Search coding of a graph. More...
class	DFSTree
	A DFSTree is used by gspan to sort lexicographically patterns discovered in an interface graph. More...
class	EdgeCode
	represent a DFS code used by gspan. More...
struct	EdgeData
	Inner class to handle data about edges in graph. More...
class	EdgeGrowth
	This class is used to define an edge growth of a pattern in this DFSTree. More...
class	FrequenceSearch
	This is class is an implementation of a simple serach strategy for the gspan algorithm: it accept a growth if its frequency is above a user defined value. More...
class	InterfaceGraph
	This class represent the interface graph of a given gum::prm::PRMSystem<GUM_SCALAR>. More...
struct	LabelData
	Inner class to handle data about labels in this interface graph. More...
struct	NodeData
	Inner class to handle data about nodes in graph. More...
class	Pattern
	This contains all the information we want for a node in a DFSTree. More...
class	SearchStrategy
	This is an abstract class used to tune search strategies in the gspan algorithm. More...
class	StrictSearch
	This is class is an implementation of a strict strategy for the GSpan algorithm. More...
class	TreeWidthSearch
	A growth is accepted if and only if the new growth has a tree width less large or equal than its father. More...

Functions
std::ostream &	operator<< (std::ostream &out, const DFSCode &code)
	Print code in out. More...
std::ostream &	operator<< (std::ostream &out, const EdgeCode &code)
	Print code in out. More...
std::ostream &	operator<< (std::ostream &out, const LabelData &data)
	Print a LabelData in out. More...
template<typename GUM_SCALAR >
INLINE std::ostream &	operator<< (std::ostream &out, const EdgeGrowth< GUM_SCALAR > &edge)
template<typename GUM_SCALAR >
std::ostream &	operator<< (std::ostream &out, const EdgeGrowth< GUM_SCALAR > &edge)
template<typename GUM_SCALAR >
std::ostream &	operator<< (std::ostream &out, const NodeData< GUM_SCALAR > &data)
	Print a NodeData<GUM_SCALAR> in out. More...
template<typename GUM_SCALAR >
std::ostream &	operator<< (std::ostream &out, const EdgeData< GUM_SCALAR > &data)
	Print a EdgeData<GUM_SCALAR> in out. More...
template<typename GUM_SCALAR >
INLINE std::ostream &	operator<< (std::ostream &out, const NodeData< GUM_SCALAR > &data)
	Print a NodeData<GUM_SCALAR> in out. More...
template<typename GUM_SCALAR >
INLINE std::ostream &	operator<< (std::ostream &out, const EdgeData< GUM_SCALAR > &data)
	Print a EdgeData<GUM_SCALAR> in out. More...

Function Documentation

operator<<() [1/9]

std::ostream & gum::prm::gspan::operator<<	(	std::ostream &	out,
		const LabelData &	data
	)

Print a LabelData in out.

Parameters

out	The stream in which data is printed.
data	The data printed.

Returns

Returns out.

Definition at line 35 of file interfaceGraph.cpp.

                                                                     {
        out << data.l;
        return out;
      }

operator<<() [2/9]

std::ostream & gum::prm::gspan::operator<<	(	std::ostream &	out,
		const EdgeCode &	code
	)

Print code in out.

Parameters

out	The stream in which code is printed.
code	The printed EdgeCode.

Returns

Returns out after printing code in it.

Definition at line 39 of file edgeCode.cpp.

                                                                    {
        out << "(" << code.i << ", " << code.j << ", " << code.l_i << ", ";
        out << code.l_ij << ", " << code.l_j << ")";
        return out;
      }

operator<<() [3/9]

std::ostream & gum::prm::gspan::operator<<	(	std::ostream &	out,
		const DFSCode &	code
	)

Print code in out.

Parameters

out	The stream in which code is printed.
code	The printed DFSCode.

Returns

Returns out after printing code in it.

Definition at line 39 of file DFSCode.cpp.

                                                                   {
        out << "[ ";
        bool first = true;

        for (const auto item: code.codes) {
          if (!first) out << ", ";
          out << *item;
          first = false;
        }

        out << " ]";
        return out;
      }

operator<<() [4/9]

template<typename GUM_SCALAR >

std::ostream& gum::prm::gspan::operator<<	(	std::ostream &	out,
		const EdgeGrowth< GUM_SCALAR > &	edge
	)

Definition at line 477 of file DFSTree_tpl.h.

References operator<<().

                                                                                           {
        out << edge.u << ", " << *(edge.edge) << ", " << *(edge.l_v) << ", " << edge.v;
        return out;
      }

Here is the call graph for this function:

operator<<() [5/9]

template<typename GUM_SCALAR >

std::ostream& gum::prm::gspan::operator<<	(	std::ostream &	out,
		const NodeData< GUM_SCALAR > &	data
	)

Print a NodeData<GUM_SCALAR> in out.

Parameters

out	The stream in which data is printed.
data	The data printed.

Returns

Returns out.

Definition at line 364 of file interfaceGraph_tpl.h.

References operator<<().

                                                                                         {
        out << data.n->name() << "(" << data.l->l << ")";
        return out;
      }

Here is the call graph for this function:

operator<<() [6/9]

template<typename GUM_SCALAR >

std::ostream& gum::prm::gspan::operator<<	(	std::ostream &	out,
		const EdgeData< GUM_SCALAR > &	data
	)

Print a EdgeData<GUM_SCALAR> in out.

Parameters

out	The stream in which data is printed.
data	The data printed.

Returns

Returns out.

Definition at line 370 of file interfaceGraph_tpl.h.

References operator<<().

Referenced by gum::prm::gspan::DFSTree< GUM_SCALAR >::_addChild_(), gum::prm::gspan::StrictSearch< GUM_SCALAR >::_buildPatternGraph_(), gum::prm::gspan::DFSTree< GUM_SCALAR >::_checkGrowth_(), gum::prm::gspan::StrictSearch< GUM_SCALAR >::_compute_costs_(), gum::prm::gspan::StrictSearch< GUM_SCALAR >::_elimination_cost_(), gum::prm::gspan::Pattern::_expandCodeIsMinimal_(), gum::prm::gspan::DFSTree< GUM_SCALAR >::_initialiaze_root_(), gum::prm::gspan::StrictSearch< GUM_SCALAR >::_inner_cost_(), gum::prm::gspan::DFSTree< GUM_SCALAR >::_is_new_seq_(), gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::_label_(), gum::prm::gspan::Pattern::_not_rec_(), gum::prm::gspan::StrictSearch< GUM_SCALAR >::_outer_cost_(), gum::prm::gspan::Pattern::_rec_(), gum::prm::gspan::StrictSearch< GUM_SCALAR >::_str_(), gum::prm::gspan::DFSTree< GUM_SCALAR >::_test_equality_(), gum::prm::gspan::FrequenceSearch< GUM_SCALAR >::accept_growth(), gum::prm::gspan::StrictSearch< GUM_SCALAR >::accept_growth(), gum::prm::gspan::TreeWidthSearch< GUM_SCALAR >::accept_growth(), gum::prm::gspan::FrequenceSearch< GUM_SCALAR >::accept_root(), gum::prm::gspan::StrictSearch< GUM_SCALAR >::accept_root(), gum::prm::gspan::TreeWidthSearch< GUM_SCALAR >::accept_root(), gum::prm::gspan::Pattern::addArc(), gum::prm::gspan::Pattern::addNodeWithLabel(), gum::prm::gspan::DFSTree< GUM_SCALAR >::addRoot(), gum::prm::gspan::Pattern::arcs(), gum::prm::gspan::DFSTree< GUM_SCALAR >::children(), gum::prm::gspan::Pattern::code(), gum::prm::gspan::SearchStrategy< GUM_SCALAR >::computeCost_(), gum::prm::gspan::TreeWidthSearch< GUM_SCALAR >::cost(), gum::prm::gspan::DFSTree< GUM_SCALAR >::data(), gum::prm::gspan::DFSCode::DFSCode(), gum::prm::gspan::DFSTree< GUM_SCALAR >::DFSTree(), gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::edge(), gum::prm::gspan::EdgeCode::EdgeCode(), gum::prm::gspan::Pattern::edgeCode(), gum::prm::gspan::EdgeData< GUM_SCALAR >::EdgeData(), gum::prm::gspan::EdgeGrowth< GUM_SCALAR >::EdgeGrowth(), gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::edges(), gum::prm::gspan::Pattern::exists(), gum::prm::gspan::FrequenceSearch< GUM_SCALAR >::FrequenceSearch(), gum::prm::gspan::DFSTree< GUM_SCALAR >::frequency(), gum::prm::gspan::DFSTree< GUM_SCALAR >::graph(), gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::graph(), gum::prm::gspan::DFSTree< GUM_SCALAR >::growPattern(), gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::id(), gum::prm::gspan::EdgeGrowth< GUM_SCALAR >::insert(), gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::InterfaceGraph(), gum::prm::gspan::EdgeCode::isBackward(), gum::prm::gspan::EdgeCode::isForward(), gum::prm::gspan::Pattern::isMinimal(), gum::prm::gspan::DFSTree< GUM_SCALAR >::iso_graph(), gum::prm::gspan::DFSTree< GUM_SCALAR >::iso_map(), gum::prm::gspan::Pattern::label(), gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::label(), gum::prm::gspan::LabelData::LabelData(), gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::labels(), gum::prm::gspan::Pattern::lastAdded(), gum::prm::gspan::DFSTree< GUM_SCALAR >::max_indep_set(), gum::prm::gspan::DFSTree< GUM_SCALAR >::NeighborDegreeSort::NeighborDegreeSort(), gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::node(), gum::prm::gspan::NodeData< GUM_SCALAR >::NodeData(), gum::prm::gspan::Pattern::nodes(), gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::nodes(), gum::prm::gspan::LabelData::operator!=(), gum::prm::gspan::NodeData< GUM_SCALAR >::operator!=(), gum::prm::gspan::DFSCode::operator!=(), gum::prm::gspan::EdgeCode::operator!=(), gum::prm::gspan::EdgeData< GUM_SCALAR >::operator!=(), gum::prm::gspan::FrequenceSearch< GUM_SCALAR >::operator()(), gum::prm::gspan::StrictSearch< GUM_SCALAR >::operator()(), gum::prm::gspan::DFSTree< GUM_SCALAR >::NeighborDegreeSort::operator()(), gum::prm::gspan::TreeWidthSearch< GUM_SCALAR >::operator()(), gum::prm::gspan::DFSCode::operator<(), gum::prm::gspan::EdgeCode::operator<(), operator<<(), gum::prm::gspan::DFSCode::operator<=(), gum::prm::gspan::SearchStrategy< GUM_SCALAR >::operator=(), gum::prm::gspan::DFSCode::operator=(), gum::prm::gspan::EdgeCode::operator=(), gum::prm::gspan::FrequenceSearch< GUM_SCALAR >::operator=(), gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::operator=(), gum::prm::gspan::StrictSearch< GUM_SCALAR >::operator=(), gum::prm::gspan::LabelData::operator==(), gum::prm::gspan::NodeData< GUM_SCALAR >::operator==(), gum::prm::gspan::DFSCode::operator==(), gum::prm::gspan::EdgeCode::operator==(), gum::prm::gspan::EdgeData< GUM_SCALAR >::operator==(), gum::prm::gspan::DFSTree< GUM_SCALAR >::parent(), gum::prm::gspan::Pattern::Pattern(), gum::prm::gspan::DFSTree< GUM_SCALAR >::pattern(), gum::prm::gspan::DFSTree< GUM_SCALAR >::PatternData::PatternData(), gum::prm::gspan::Pattern::pop_back(), gum::prm::gspan::Pattern::remove(), gum::prm::gspan::Pattern::rightmostPath(), gum::prm::gspan::DFSTree< GUM_SCALAR >::roots(), gum::prm::gspan::SearchStrategy< GUM_SCALAR >::SearchStrategy(), gum::prm::gspan::SearchStrategy< GUM_SCALAR >::setTree(), gum::prm::gspan::Pattern::size(), gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::size(), gum::prm::gspan::Pattern::sizeArcs(), gum::prm::gspan::DFSTree< GUM_SCALAR >::strategy(), gum::prm::gspan::StrictSearch< GUM_SCALAR >::StrictSearch(), gum::prm::gspan::Pattern::toDot(), gum::prm::gspan::EdgeGrowth< GUM_SCALAR >::toString(), gum::prm::gspan::TreeWidthSearch< GUM_SCALAR >::TreeWidthSearch(), gum::prm::gspan::DFSCode::~DFSCode(), gum::prm::gspan::DFSTree< GUM_SCALAR >::~DFSTree(), gum::prm::gspan::EdgeCode::~EdgeCode(), gum::prm::gspan::EdgeData< GUM_SCALAR >::~EdgeData(), gum::prm::gspan::EdgeGrowth< GUM_SCALAR >::~EdgeGrowth(), gum::prm::gspan::FrequenceSearch< GUM_SCALAR >::~FrequenceSearch(), gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::~InterfaceGraph(), gum::prm::gspan::LabelData::~LabelData(), gum::prm::gspan::DFSTree< GUM_SCALAR >::NeighborDegreeSort::~NeighborDegreeSort(), gum::prm::gspan::NodeData< GUM_SCALAR >::~NodeData(), gum::prm::gspan::Pattern::~Pattern(), gum::prm::gspan::DFSTree< GUM_SCALAR >::PatternData::~PatternData(), gum::prm::gspan::SearchStrategy< GUM_SCALAR >::~SearchStrategy(), gum::prm::gspan::StrictSearch< GUM_SCALAR >::~StrictSearch(), and gum::prm::gspan::TreeWidthSearch< GUM_SCALAR >::~TreeWidthSearch().

                                                                                         {
        out << data.u->name() << " -> " << data.v->name() << "(" << data.l->l << ")";
        return out;
      }

Here is the call graph for this function:

operator<<() [7/9]

template<typename GUM_SCALAR >

INLINE std::ostream& gum::prm::gspan::operator<<	(	std::ostream &	out,
		const NodeData< GUM_SCALAR > &	data
	)

Print a NodeData<GUM_SCALAR> in out.

Parameters

out	The stream in which data is printed.
data	The data printed.

Returns

Returns out.

Definition at line 364 of file interfaceGraph_tpl.h.

References operator<<().

                                                                                         {
        out << data.n->name() << "(" << data.l->l << ")";
        return out;
      }

Here is the call graph for this function:

operator<<() [8/9]

template<typename GUM_SCALAR >

INLINE std::ostream& gum::prm::gspan::operator<<	(	std::ostream &	out,
		const EdgeData< GUM_SCALAR > &	data
	)

Print a EdgeData<GUM_SCALAR> in out.

Parameters

out	The stream in which data is printed.
data	The data printed.

Returns

Returns out.

Definition at line 370 of file interfaceGraph_tpl.h.

References operator<<().

Referenced by gum::prm::gspan::DFSTree< GUM_SCALAR >::_addChild_(), gum::prm::gspan::StrictSearch< GUM_SCALAR >::_buildPatternGraph_(), gum::prm::gspan::DFSTree< GUM_SCALAR >::_checkGrowth_(), gum::prm::gspan::StrictSearch< GUM_SCALAR >::_compute_costs_(), gum::prm::gspan::StrictSearch< GUM_SCALAR >::_elimination_cost_(), gum::prm::gspan::Pattern::_expandCodeIsMinimal_(), gum::prm::gspan::DFSTree< GUM_SCALAR >::_initialiaze_root_(), gum::prm::gspan::StrictSearch< GUM_SCALAR >::_inner_cost_(), gum::prm::gspan::DFSTree< GUM_SCALAR >::_is_new_seq_(), gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::_label_(), gum::prm::gspan::Pattern::_not_rec_(), gum::prm::gspan::StrictSearch< GUM_SCALAR >::_outer_cost_(), gum::prm::gspan::Pattern::_rec_(), gum::prm::gspan::StrictSearch< GUM_SCALAR >::_str_(), gum::prm::gspan::DFSTree< GUM_SCALAR >::_test_equality_(), gum::prm::gspan::FrequenceSearch< GUM_SCALAR >::accept_growth(), gum::prm::gspan::StrictSearch< GUM_SCALAR >::accept_growth(), gum::prm::gspan::TreeWidthSearch< GUM_SCALAR >::accept_growth(), gum::prm::gspan::FrequenceSearch< GUM_SCALAR >::accept_root(), gum::prm::gspan::StrictSearch< GUM_SCALAR >::accept_root(), gum::prm::gspan::TreeWidthSearch< GUM_SCALAR >::accept_root(), gum::prm::gspan::Pattern::addArc(), gum::prm::gspan::Pattern::addNodeWithLabel(), gum::prm::gspan::DFSTree< GUM_SCALAR >::addRoot(), gum::prm::gspan::Pattern::arcs(), gum::prm::gspan::DFSTree< GUM_SCALAR >::children(), gum::prm::gspan::Pattern::code(), gum::prm::gspan::SearchStrategy< GUM_SCALAR >::computeCost_(), gum::prm::gspan::TreeWidthSearch< GUM_SCALAR >::cost(), gum::prm::gspan::DFSTree< GUM_SCALAR >::data(), gum::prm::gspan::DFSCode::DFSCode(), gum::prm::gspan::DFSTree< GUM_SCALAR >::DFSTree(), gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::edge(), gum::prm::gspan::EdgeCode::EdgeCode(), gum::prm::gspan::Pattern::edgeCode(), gum::prm::gspan::EdgeData< GUM_SCALAR >::EdgeData(), gum::prm::gspan::EdgeGrowth< GUM_SCALAR >::EdgeGrowth(), gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::edges(), gum::prm::gspan::Pattern::exists(), gum::prm::gspan::FrequenceSearch< GUM_SCALAR >::FrequenceSearch(), gum::prm::gspan::DFSTree< GUM_SCALAR >::frequency(), gum::prm::gspan::DFSTree< GUM_SCALAR >::graph(), gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::graph(), gum::prm::gspan::DFSTree< GUM_SCALAR >::growPattern(), gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::id(), gum::prm::gspan::EdgeGrowth< GUM_SCALAR >::insert(), gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::InterfaceGraph(), gum::prm::gspan::EdgeCode::isBackward(), gum::prm::gspan::EdgeCode::isForward(), gum::prm::gspan::Pattern::isMinimal(), gum::prm::gspan::DFSTree< GUM_SCALAR >::iso_graph(), gum::prm::gspan::DFSTree< GUM_SCALAR >::iso_map(), gum::prm::gspan::Pattern::label(), gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::label(), gum::prm::gspan::LabelData::LabelData(), gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::labels(), gum::prm::gspan::Pattern::lastAdded(), gum::prm::gspan::DFSTree< GUM_SCALAR >::max_indep_set(), gum::prm::gspan::DFSTree< GUM_SCALAR >::NeighborDegreeSort::NeighborDegreeSort(), gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::node(), gum::prm::gspan::NodeData< GUM_SCALAR >::NodeData(), gum::prm::gspan::Pattern::nodes(), gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::nodes(), gum::prm::gspan::LabelData::operator!=(), gum::prm::gspan::NodeData< GUM_SCALAR >::operator!=(), gum::prm::gspan::DFSCode::operator!=(), gum::prm::gspan::EdgeCode::operator!=(), gum::prm::gspan::EdgeData< GUM_SCALAR >::operator!=(), gum::prm::gspan::FrequenceSearch< GUM_SCALAR >::operator()(), gum::prm::gspan::StrictSearch< GUM_SCALAR >::operator()(), gum::prm::gspan::DFSTree< GUM_SCALAR >::NeighborDegreeSort::operator()(), gum::prm::gspan::TreeWidthSearch< GUM_SCALAR >::operator()(), gum::prm::gspan::DFSCode::operator<(), gum::prm::gspan::EdgeCode::operator<(), operator<<(), gum::prm::gspan::DFSCode::operator<=(), gum::prm::gspan::SearchStrategy< GUM_SCALAR >::operator=(), gum::prm::gspan::DFSCode::operator=(), gum::prm::gspan::EdgeCode::operator=(), gum::prm::gspan::FrequenceSearch< GUM_SCALAR >::operator=(), gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::operator=(), gum::prm::gspan::StrictSearch< GUM_SCALAR >::operator=(), gum::prm::gspan::LabelData::operator==(), gum::prm::gspan::NodeData< GUM_SCALAR >::operator==(), gum::prm::gspan::DFSCode::operator==(), gum::prm::gspan::EdgeCode::operator==(), gum::prm::gspan::EdgeData< GUM_SCALAR >::operator==(), gum::prm::gspan::DFSTree< GUM_SCALAR >::parent(), gum::prm::gspan::Pattern::Pattern(), gum::prm::gspan::DFSTree< GUM_SCALAR >::pattern(), gum::prm::gspan::DFSTree< GUM_SCALAR >::PatternData::PatternData(), gum::prm::gspan::Pattern::pop_back(), gum::prm::gspan::Pattern::remove(), gum::prm::gspan::Pattern::rightmostPath(), gum::prm::gspan::DFSTree< GUM_SCALAR >::roots(), gum::prm::gspan::SearchStrategy< GUM_SCALAR >::SearchStrategy(), gum::prm::gspan::SearchStrategy< GUM_SCALAR >::setTree(), gum::prm::gspan::Pattern::size(), gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::size(), gum::prm::gspan::Pattern::sizeArcs(), gum::prm::gspan::DFSTree< GUM_SCALAR >::strategy(), gum::prm::gspan::StrictSearch< GUM_SCALAR >::StrictSearch(), gum::prm::gspan::Pattern::toDot(), gum::prm::gspan::EdgeGrowth< GUM_SCALAR >::toString(), gum::prm::gspan::TreeWidthSearch< GUM_SCALAR >::TreeWidthSearch(), gum::prm::gspan::DFSCode::~DFSCode(), gum::prm::gspan::DFSTree< GUM_SCALAR >::~DFSTree(), gum::prm::gspan::EdgeCode::~EdgeCode(), gum::prm::gspan::EdgeData< GUM_SCALAR >::~EdgeData(), gum::prm::gspan::EdgeGrowth< GUM_SCALAR >::~EdgeGrowth(), gum::prm::gspan::FrequenceSearch< GUM_SCALAR >::~FrequenceSearch(), gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::~InterfaceGraph(), gum::prm::gspan::LabelData::~LabelData(), gum::prm::gspan::DFSTree< GUM_SCALAR >::NeighborDegreeSort::~NeighborDegreeSort(), gum::prm::gspan::NodeData< GUM_SCALAR >::~NodeData(), gum::prm::gspan::Pattern::~Pattern(), gum::prm::gspan::DFSTree< GUM_SCALAR >::PatternData::~PatternData(), gum::prm::gspan::SearchStrategy< GUM_SCALAR >::~SearchStrategy(), gum::prm::gspan::StrictSearch< GUM_SCALAR >::~StrictSearch(), and gum::prm::gspan::TreeWidthSearch< GUM_SCALAR >::~TreeWidthSearch().

                                                                                         {
        out << data.u->name() << " -> " << data.v->name() << "(" << data.l->l << ")";
        return out;
      }

Here is the call graph for this function:

operator<<() [9/9]

template<typename GUM_SCALAR >

INLINE std::ostream& gum::prm::gspan::operator<<	(	std::ostream &	out,
		const EdgeGrowth< GUM_SCALAR > &	edge
	)

Definition at line 477 of file DFSTree_tpl.h.

References operator<<().

                                                                                           {
        out << edge.u << ", " << *(edge.edge) << ", " << *(edge.l_v) << ", " << edge.v;
        return out;
      }

Here is the call graph for this function: