| 558 | |
| 559 | template <typename directed_graph> |
| 560 | void print_graph( |
| 561 | const directed_graph& g |
| 562 | ) |
| 563 | { |
| 564 | using namespace std; |
| 565 | dlog << LTRACE << "number of nodes: "<< g.number_of_nodes(); |
| 566 | for (unsigned long i = 0; i < g.number_of_nodes(); ++i) |
| 567 | { |
| 568 | for (unsigned long n = 0; n < g.node(i).number_of_children(); ++n) |
| 569 | dlog << LTRACE << i << " -(" << g.node(i).child_edge(n) << ")-> " << g.node(i).child(n).index(); |
| 570 | } |
| 571 | } |
| 572 | |
| 573 | template <typename directed_graph> |
| 574 | void copy_edge_weights ( |
no test coverage detected