Aleph::Graph_To_Tree_Node< GT, Key, Convert, SA > Class Template Reference

Functor class to convert a tree graph to Tree_Node structure. More...

#include <graph_to_tree.H>

Public Member Functions
	Graph_To_Tree_Node (SA __sa=SA())
Tree_Node< Key > *	operator() (GT &g, typename GT::Node *groot, Convert &&conv=Convert())
	Convert a tree graph to Tree_Node structure.
Tree_Node< Key > *	operator() (GT &g, typename GT::Node *groot, Convert &conv)

Private Member Functions
void	graph_to_tree (typename GT::Node *groot, Tree_Node< Key > *troot)
Tree_Node< Key > *	graph_to_tree (GT &g, typename GT::Node *groot, Convert &conv)

Private Attributes
SA	sa
Convert *	convert = nullptr

Detailed Description

template<AlephGraph GT, typename Key, class Convert, ArcFilter< GT > SA = Dft_Show_Arc<GT>>
class Aleph::Graph_To_Tree_Node< GT, Key, Convert, SA >

Functor class to convert a tree graph to Tree_Node structure.

Provides a callable interface for converting spanning trees from graph representation to Tree_Node<Key> representation.

This class version offers more flexibility than the free function, allowing the arc filter to be configured at construction time.

Template Parameters

• GT: Graph type (derived from List_Graph)
• Key: Data type to store in tree nodes
• Convert: Functor class with operator()(gnode, tnode) that copies data from graph nodes to tree nodes
• SA: Arc filter class (default: show all arcs)

Usage Example

struct MyConvert {
  void operator()(Graph::Node* gn, Tree_Node<int>* tn) {
    tn->get_key() = gn->get_info().id;
  }
};
 
Graph_To_Tree_Node<Graph, int, MyConvert> converter;
auto* root = converter(g, start_node);

See also

graph_to_tree_node() Free function alternative

Tree_Node Target tree structure

Definition at line 213 of file graph_to_tree.H.

Constructor & Destructor Documentation

Graph_To_Tree_Node()

template<AlephGraph GT, typename Key , class Convert , ArcFilter< GT > SA = Dft_Show_Arc<GT>>

Aleph::Graph_To_Tree_Node< GT, Key, Convert, SA >::Graph_To_Tree_Node ( SA  __sa = SA() )

inline

Definition at line 262 of file graph_to_tree.H.

Member Function Documentation

graph_to_tree() [1/2]

template<AlephGraph GT, typename Key , class Convert , ArcFilter< GT > SA = Dft_Show_Arc<GT>>

Tree_Node< Key > * Aleph::Graph_To_Tree_Node< GT, Key, Convert, SA >::graph_to_tree ( GT &  g, typename GT::Node *  groot, Convert &  conv  )

inlineprivate

Definition at line 242 of file graph_to_tree.H.

References ah_domain_error_if, Aleph::blossom_maximum_cardinality_matching(), Aleph::Graph_To_Tree_Node< GT, Key, Convert, SA >::convert, and Aleph::Graph_To_Tree_Node< GT, Key, Convert, SA >::graph_to_tree().

graph_to_tree() [2/2]

template<AlephGraph GT, typename Key , class Convert , ArcFilter< GT > SA = Dft_Show_Arc<GT>>

void Aleph::Graph_To_Tree_Node< GT, Key, Convert, SA >::graph_to_tree ( typename GT::Node *  groot, Tree_Node< Key > *  troot  )

inlineprivate

Definition at line 218 of file graph_to_tree.H.

References ARC_BITS, Aleph::blossom_maximum_cardinality_matching(), Aleph::Convert_Tree, Aleph::Graph_To_Tree_Node< GT, Key, Convert, SA >::graph_to_tree(), Aleph::Tree_Node< T >::insert_rightmost_child(), IS_ARC_VISITED, Aleph::Filter_Iterator< Container, It, Show_Item >::next_ne(), and Aleph::Graph_To_Tree_Node< GT, Key, Convert, SA >::sa.

Referenced by Aleph::Graph_To_Tree_Node< GT, Key, Convert, SA >::graph_to_tree(), Aleph::Graph_To_Tree_Node< GT, Key, Convert, SA >::graph_to_tree(), Aleph::Graph_To_Tree_Node< GT, Key, Convert, SA >::operator()(), and Aleph::Graph_To_Tree_Node< GT, Key, Convert, SA >::operator()().

operator()() [1/2]

template<AlephGraph GT, typename Key , class Convert , ArcFilter< GT > SA = Dft_Show_Arc<GT>>

Tree_Node< Key > * Aleph::Graph_To_Tree_Node< GT, Key, Convert, SA >::operator() ( GT &  g, typename GT::Node *  groot, Convert &&  conv = Convert()  )

inline

Convert a tree graph to Tree_Node structure.

Parameters

g	The tree graph to convert (must be acyclic)
groot	Node to use as the tree root
conv	Converter functor instance

Returns

Root of the new Tree_Node<Key> tree

Exceptions

std::domain_error	If the graph is not acyclic
std::bad_alloc	If memory allocation fails

Definition at line 275 of file graph_to_tree.H.

References Aleph::blossom_maximum_cardinality_matching(), and Aleph::Graph_To_Tree_Node< GT, Key, Convert, SA >::graph_to_tree().

operator()() [2/2]

template<AlephGraph GT, typename Key , class Convert , ArcFilter< GT > SA = Dft_Show_Arc<GT>>

Tree_Node< Key > * Aleph::Graph_To_Tree_Node< GT, Key, Convert, SA >::operator() ( GT &  g, typename GT::Node *  groot, Convert &  conv  )

inline

Definition at line 281 of file graph_to_tree.H.

References Aleph::blossom_maximum_cardinality_matching(), and Aleph::Graph_To_Tree_Node< GT, Key, Convert, SA >::graph_to_tree().

Member Data Documentation

convert

template<AlephGraph GT, typename Key , class Convert , ArcFilter< GT > SA = Dft_Show_Arc<GT>>

Convert* Aleph::Graph_To_Tree_Node< GT, Key, Convert, SA >::convert = nullptr

private

Definition at line 216 of file graph_to_tree.H.

Referenced by Aleph::Graph_To_Tree_Node< GT, Key, Convert, SA >::graph_to_tree().

sa

template<AlephGraph GT, typename Key , class Convert , ArcFilter< GT > SA = Dft_Show_Arc<GT>>

SA Aleph::Graph_To_Tree_Node< GT, Key, Convert, SA >::sa

private

Definition at line 215 of file graph_to_tree.H.

Referenced by Aleph::Graph_To_Tree_Node< GT, Key, Convert, SA >::graph_to_tree().

---

The documentation for this class was generated from the following file:

• graph_to_tree.H