28 #include <mln/util/graph.hh>
29 #include <mln/util/line_graph.hh>
58 mln_vertex_fwd_iter_(LG) v(lg);
60 mln_assertion(i++ == v.
id());
61 mln_assertion(i != 0);
64 mln_edge_fwd_iter_(LG) e(lg);
66 mln_assertion(i++ == e.
id());
67 mln_assertion(i != 0);
72 unsigned i = lg.v_nmax() - 1;
73 mln_vertex_bkd_iter_(LG) v(lg);
75 mln_assertion(i-- == v.
id());
76 mln_assertion(i != lg.v_nmax() - 1);
79 mln_edge_bkd_iter_(LG) e(lg);
81 mln_assertion(i-- == e.
id());
82 mln_assertion(i != lg.e_nmax() - 1);
87 mln_vertex_fwd_iter_(LG) v(lg);
88 mln_vertex_nbh_edge_fwd_iter_(LG) n(v);
93 mln_assertion(i++ == n.index());
94 mln_assertion(i != 0);
100 mln_vertex_bkd_iter_(LG) v(lg);
101 mln_vertex_nbh_edge_bkd_iter_(LG) e(v);
104 unsigned i = v.nmax_nbh_edges();
106 mln_assertion(--i == e.index());
107 mln_assertion((v.nmax_nbh_edges() == 0 && i == 0)
108 || i != v.nmax_nbh_edges());
112 mln_edge_fwd_iter_(LG) e(lg);
113 mln_edge_nbh_edge_fwd_iter_(LG) n(e);
121 mln_assertion((i == 0 && e.nmax_nbh_edges() < 2)
122 || i == e.nmax_nbh_edges() - 2);
126 mln_edge_bkd_iter_(LG) e(lg);
127 mln_edge_nbh_edge_bkd_iter_(LG) n(e);
131 unsigned i = e.nmax_nbh_edges();
136 mln_assertion((i == e.nmax_nbh_edges() && e.nmax_nbh_edges() < 2)
142 mln_vertex_fwd_iter_(LG) v(lg);
143 mln_vertex_nbh_vertex_fwd_iter_(LG) n(v);
149 mln_assertion(i == v.nmax_nbh_vertices());
153 mln_vertex_bkd_iter_(LG) v(lg);
154 mln_vertex_nbh_vertex_bkd_iter_(LG) n(v);
157 unsigned i = v.nmax_nbh_vertices();
160 mln_assertion(i == 0);