26 #include <mln/util/graph.hh>
27 #include <mln/util/line_graph.hh>
57 mln_vertex_fwd_iter_(LG) v(lg);
59 mln_assertion(i++ == v.
id());
60 mln_assertion(i != 0);
63 mln_edge_fwd_iter_(LG) e(lg);
65 mln_assertion(i++ == e.
id());
66 mln_assertion(i != 0);
71 unsigned i = lg.v_nmax() - 1;
72 mln_vertex_bkd_iter_(LG) v(lg);
74 mln_assertion(i-- == v.
id());
75 mln_assertion(i != lg.v_nmax() - 1);
78 mln_edge_bkd_iter_(LG) e(lg);
80 mln_assertion(i-- == e.
id());
81 mln_assertion(i != lg.e_nmax() - 1);
86 mln_vertex_fwd_iter_(LG) v(lg);
87 mln_vertex_nbh_edge_fwd_iter_(LG) n(v);
92 mln_assertion(i++ == n.index());
93 mln_assertion(i != 0);
99 mln_vertex_bkd_iter_(LG) v(lg);
100 mln_vertex_nbh_edge_bkd_iter_(LG) e(v);
103 unsigned i = v.nmax_nbh_edges();
105 mln_assertion(--i == e.index());
106 mln_assertion((v.nmax_nbh_edges() == 0 && i == 0) || i != v.nmax_nbh_edges());
110 mln_edge_fwd_iter_(LG) e(lg);
111 mln_edge_nbh_edge_fwd_iter_(LG) n(e);
119 mln_assertion((i == 0 && e.nmax_nbh_edges() < 2) || i == e.nmax_nbh_edges() - 2);
123 mln_edge_bkd_iter_(LG) e(lg);
124 mln_edge_nbh_edge_bkd_iter_(LG) n(e);
128 unsigned i = e.nmax_nbh_edges();
133 mln_assertion((i == e.nmax_nbh_edges() && e.nmax_nbh_edges() < 2) || i == 2);
138 mln_vertex_fwd_iter_(LG) v(lg);
139 mln_vertex_nbh_vertex_fwd_iter_(LG) n(v);
145 mln_assertion(i == v.nmax_nbh_vertices());
149 mln_vertex_bkd_iter_(LG) v(lg);
150 mln_vertex_nbh_vertex_bkd_iter_(LG) n(v);
153 unsigned i = v.nmax_nbh_vertices();
156 mln_assertion(i == 0);