#include <GDT/gdtlist.h>
#include <GDT/gdtmap.h>
#include <GDT/rm3_plan_undi_graph.h>
#include <GDT/rm3_global.h>
Go to the source code of this file.
Classes | |
class | struct_upwa_node_info |
class | upwa_plan_undi_graph |
Defines | |
#define | forall_candidate_edges_entering_node(e, v, G) for(e=(G).first_in_cand_edge(v);e;e=(G).cand_edge_succ(e,v)) |
#define | forall_candidate_edges_leaving_node(e, v, G) for(e=(G).first_out_cand_edge(v);e;e=(G).cand_edge_succ(e,v)) |
Definition in file rm3_upwa_plan_undi_graph.h.
#define forall_candidate_edges_entering_node | ( | e, | |||
v, | |||||
G | ) | for(e=(G).first_in_cand_edge(v);e;e=(G).cand_edge_succ(e,v)) |
Definition at line 1034 of file rm3_upwa_plan_undi_graph.h.
#define forall_candidate_edges_leaving_node | ( | e, | |||
v, | |||||
G | ) | for(e=(G).first_out_cand_edge(v);e;e=(G).cand_edge_succ(e,v)) |
Definition at line 1037 of file rm3_upwa_plan_undi_graph.h.