|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
#include <iostream>#include <string>#include <stdexcept>#include <ah-errors.H>#include <tpl_tree_node.H>#include <tpl_dynArray.H>#include <cassert>Go to the source code of this file.
Typedefs | |
| using | Node = Tree_Node< string > |
Functions | |
| static void | print_node (Node *node, int level, int index) |
| static Node * | append_child (Node *parent, const string &name) |
| static void | draw_children (Node *node, const string &prefix) |
| static void | draw_tree (Node *root) |
| static void | print_dewey_view (Node *node, const string &dewey, size_t level) |
| Print every node with its Dewey number and depth indentation. | |
| int | main () |
Definition at line 43 of file test_tree_node.C.
Definition at line 50 of file test_tree_node.C.
Referenced by main().
|
static |
Definition at line 57 of file test_tree_node.C.
References draw_children(), and Aleph::prefix().
Referenced by draw_children(), and draw_tree().
|
static |
Definition at line 68 of file test_tree_node.C.
References draw_children(), and root().
Referenced by main().
| int main | ( | void | ) |
Definition at line 90 of file test_tree_node.C.
References append_child(), Aleph::are_tree_equal(), Aleph::blossom_maximum_cardinality_matching(), Aleph::clone_tree(), Aleph::copy(), Aleph::destroy_tree(), Aleph::deway_search(), draw_tree(), print_dewey_view(), print_node(), root(), Aleph::tree_postorder_traversal(), and Aleph::tree_preorder_traversal().
|
static |
Print every node with its Dewey number and depth indentation.
| [in] | node | current node. |
| [in] | dewey | Dewey number of node. |
| [in] | level | depth of node. |
Definition at line 80 of file test_tree_node.C.
References Aleph::blossom_maximum_cardinality_matching(), print_dewey_view(), and Aleph::to_string().
Referenced by main(), and print_dewey_view().
|
static |
Definition at line 45 of file test_tree_node.C.
References Aleph::Tree_Node< T >::get_data().
Referenced by main().