Educational examples for converting graphs to tree structures. More...

#include <iostream>
#include <tpl_graph.H>
#include <tpl_tree_node.H>
#include <graph_to_tree.H>
#include <tpl_graph_utils.H>
#include <generate_tree.H>

Include dependency graph for graph_to_tree_example.cc:

Functions
template<typename T >
void	print_tree (Tree_Node< T > *node, int depth=0)

template<typename T >
void	delete_tree (Tree_Node< T > *node)

int	main ()

Detailed Description

Educational examples for converting graphs to tree structures.

WHY CONVERT GRAPH TO TREE?

Trees are simpler than graphs (no cycles)
Tree algorithms are often more efficient
Tree visualization is easier (ntreepic, btreepic)
Spanning trees capture connectivity

IMPORTANT DISTINCTION:

graph_to_tree.H: Converts an ACYCLIC graph (already a tree) to Tree_Node
tpl_graph_utils.H: Extracts spanning trees from graphs WITH cycles

If your graph has cycles, you must first extract a spanning tree, then convert that spanning tree to Tree_Node format.

COMPILE & RUN:

Built as part of Aleph-w examples, or manually with the library.

Definition in file graph_to_tree_example.cc.

Function Documentation

◆ delete_tree()

template<typename T >

void delete_tree ( Tree_Node< T > * node )

Definition at line 61 of file graph_to_tree_example.cc.

References delete_tree(), Aleph::Tree_Node< T >::get_left_child(), Aleph::Tree_Node< T >::get_right_sibling(), and Aleph::next().

Referenced by delete_tree(), main(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), and TEST().

◆ main()

int main ( )

Definition at line 77 of file graph_to_tree_example.cc.

References delete_tree(), GraphCommon< GT, Node, Arc >::get_num_arcs(), GraphCommon< GT, Node, Arc >::get_num_nodes(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node(), Aleph::maps(), print_tree(), and root().

◆ print_tree()

template<typename T >

void print_tree	(	Tree_Node< T > *	node,
		int	depth = `0`
	)

Definition at line 39 of file graph_to_tree_example.cc.

References Aleph::Tree_Node< T >::get_key(), Aleph::Tree_Node< T >::get_left_child(), Aleph::maps(), and print_tree().

Referenced by main(), and print_tree().

Functions