| add_edge(const vertex_id_t &id_v1, const vertex_id_t &id_v2) | mln::util::graph | [inline] |
| add_vertex() | mln::util::graph | [inline] |
| add_vertices(unsigned n) | mln::util::graph | [inline] |
| e_ith_nbh_edge(const edge_id_t &id_e, unsigned i) const | mln::util::graph | [inline] |
| e_nmax() const | mln::util::graph | [inline] |
| e_nmax_nbh_edges(const edge_id_t &id_e) const | mln::util::graph | [inline] |
| edge(const edge_id_t &e) const | mln::util::graph | [inline] |
| edge(const vertex_t &v1, const vertex_t &v2) const | mln::util::graph | [inline] |
| edge_fwd_iter typedef | mln::util::graph | |
| edge_nbh_edge_fwd_iter typedef | mln::util::graph | |
| edges() const | mln::util::graph | [inline] |
| edges_set_t typedef | mln::util::graph | |
| edges_t typedef | mln::util::graph | |
| graph() | mln::util::graph | [inline] |
| graph(unsigned nvertices) | mln::util::graph | [inline] |
| has_e(const edge_id_t &id_e) const | mln::util::graph | [inline] |
| has_v(const vertex_id_t &id_v) const | mln::util::graph | [inline] |
| is_subgraph_of(const G2 &g) const | mln::util::graph | [inline] |
| v1(const edge_id_t &id_e) const | mln::util::graph | [inline] |
| v2(const edge_id_t &id_e) const | mln::util::graph | [inline] |
| v_ith_nbh_edge(const vertex_id_t &id_v, unsigned i) const | mln::util::graph | [inline] |
| v_ith_nbh_vertex(const vertex_id_t &id_v, unsigned i) const | mln::util::graph | [inline] |
| v_nmax() const | mln::util::graph | [inline] |
| v_nmax_nbh_edges(const vertex_id_t &id_v) const | mln::util::graph | [inline] |
| v_nmax_nbh_vertices(const vertex_id_t &id_v) const | mln::util::graph | [inline] |
| vertex(vertex_id_t id_v) const | mln::util::graph | [inline] |
| vertex_fwd_iter typedef | mln::util::graph | |
| vertex_nbh_edge_fwd_iter typedef | mln::util::graph | |
| vertex_nbh_vertex_fwd_iter typedef | mln::util::graph | |
| vertices_t typedef | mln::util::graph |
1.5.6