#include <GDT/rm3_undi_graph.h>
Go to the source code of this file.
Classes | |
class | struct_tree_node_info |
class | tree |
Defines | |
#define | forall_son_nodes(w, v, G) for(w=(G).first_son_node(v);w;w=(G).son_succ(w,v)) |
#define | forall_son_edges(e, v, G) for(e=(G).first_son_edge(v);e;e=(G).son_succ(e,v)) |
Definition in file rm3_tree.h.
#define forall_son_edges | ( | e, | |||
v, | |||||
G | ) | for(e=(G).first_son_edge(v);e;e=(G).son_succ(e,v)) |
Definition at line 620 of file rm3_tree.h.
#define forall_son_nodes | ( | w, | |||
v, | |||||
G | ) | for(w=(G).first_son_node(v);w;w=(G).son_succ(w,v)) |
Definition at line 617 of file rm3_tree.h.