Definition in file fhs_arc.cxx.
#include "fhs_arc.h"
#include <vcl_algorithm.h>
Go to the source code of this file.
Functions | |
| vcl_ostream & | operator<< (vcl_ostream &os, const fhs_arc &a) |
| Print. | |
| vcl_ostream & | operator<< (vcl_ostream &os, const vcl_vector< fhs_arc > &arc) |
| Print set. | |
| void | vsl_print_summary (vcl_ostream &os, const fhs_arc &a) |
| Print. | |
| bool | fhs_order_tree_from_root (const vcl_vector< fhs_arc > &arc0, vcl_vector< fhs_arc > &new_arc, vcl_vector< vcl_vector< unsigned > > &children, unsigned new_root) |
| Re-order list of arcs so that parents precede their children. | |
| bool fhs_order_tree_from_root | ( | const vcl_vector< fhs_arc > & | arc0, | |
| vcl_vector< fhs_arc > & | new_arc, | |||
| vcl_vector< vcl_vector< unsigned > > & | children, | |||
| unsigned | new_root | |||
| ) |
Re-order list of arcs so that parents precede their children.
Assumes that there are n nodes (indexed 0..n-1), thus n-1 arcs defining a tree. On exit children[i] gives list of children of node i
Definition at line 86 of file fhs_arc.cxx.
| vcl_ostream& operator<< | ( | vcl_ostream & | os, | |
| const vcl_vector< fhs_arc > & | arc | |||
| ) |
| vcl_ostream& operator<< | ( | vcl_ostream & | os, | |
| const fhs_arc & | a | |||
| ) |
| void vsl_print_summary | ( | vcl_ostream & | os, | |
| const fhs_arc & | a | |||
| ) |
1.5.1