26 #include <mln/util/graph.hh>
51 mln_assertion(i++ == v.
id());
52 mln_assertion(i != 0);
55 mln_edge_fwd_iter_(util::graph) e(g);
57 mln_assertion(i++ == e.
id());
58 mln_assertion(i != 0);
61 unsigned i = g.v_nmax() - 1;
64 mln_assertion(i-- == v.
id());
65 mln_assertion(i != g.v_nmax() - 1);
68 mln_edge_bkd_iter_(util::graph) e(g);
70 mln_assertion(i-- == e.
id());
71 mln_assertion(i != g.e_nmax() - 1);
77 mln_vertex_nbh_edge_fwd_iter_(util::graph) n(v);
82 mln_assertion(i++ == n.index());
83 mln_assertion(i != 0);
88 mln_vertex_nbh_edge_bkd_iter_(util::graph) e(v);
91 unsigned i = v.nmax_nbh_edges();
93 mln_assertion(--i == e.index());
94 mln_assertion((v.nmax_nbh_edges() == 0 && i == 0) || i != v.nmax_nbh_edges());
100 mln_edge_nbh_edge_fwd_iter_(util::graph) n(e);
108 mln_assertion((i == 0 && e.nmax_nbh_edges() < 2) || i == e.nmax_nbh_edges() - 2);
113 mln_edge_nbh_edge_bkd_iter_(util::graph) n(e);
117 unsigned i = e.nmax_nbh_edges();
122 mln_assertion((i == e.nmax_nbh_edges() && e.nmax_nbh_edges() < 2) || i == 2);
129 mln_vertex_nbh_vertex_fwd_iter_(util::graph) n(v);
135 mln_assertion(i == v.nmax_nbh_vertices());
140 mln_vertex_nbh_vertex_bkd_iter_(util::graph) n(v);
143 unsigned i = v.nmax_nbh_vertices();
146 mln_assertion(i == 0);