| any() const | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | |
| anyIn(const vertex_t &v) const | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | |
| begin() | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | inline |
| begin() const | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | inline |
| circ_neighbor_iterator typedef | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | |
| circ_neighbor_iterator_pair typedef | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | |
| clear(const vertex_t &v) | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | |
| clear() | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | |
| clear(iterator it) | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | |
| const_circ_neighbor_iterator typedef | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | |
| const_circ_neighbor_iterator_pair typedef | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | |
| const_edge_t typedef | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | |
| const_ineighbor_iterator typedef (defined in mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc >) | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | |
| const_ineighbor_iterator_pair typedef (defined in mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc >) | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | |
| const_iterator typedef | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | |
| const_neighbor_found_t typedef | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | protected |
| const_neighbor_iterator typedef | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | |
| const_neighbor_iterator_pair typedef | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | |
| contains(const vertex_t &v) const | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | |
| count(const vertex_t &v) const | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | |
| edge(const vertex_t &src, const vertex_t &tgt) | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | |
| edge(const vertex_t &src, const vertex_t &tgt) const | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | |
| edge_alloc (defined in mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc >) | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | static |
| edge_list_t typedef | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | protected |
| edge_t typedef | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | |
| EdgeAlloc typedef (defined in mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc >) | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | |
| empty() const | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | inline |
| empty(const vertex_t &v) const | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | |
| end() | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | inline |
| end() const | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | inline |
| erase(const vertex_t &v) | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | |
| erase(iterator pos) | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | |
| eraseAllEdges(const vertex_t &v) | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | |
| eraseAllEdges() | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | |
| eraseAllEdges(iterator it) | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | |
| eraseAllEdges(NeighborhoodPair *it) (defined in mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc >) | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | protected |
| eraseEdge(const vertex_t &src, const vertex_t &tgt) | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | |
| eraseEdge(const vertex_t &v, neighbor_iterator pos) | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | |
| eraseEdge(const vertex_t &v, circ_neighbor_iterator pos) | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | |
| findIn(const vertex_t &v, const vertex_t &n) | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | |
| findIn(const vertex_t &v, const vertex_t &n) const | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | |
| findInVertex(const vertex_t &v, const vertex_t &neighbor) | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | protected |
| findInVertex(const vertex_t &v, const vertex_t &neighbor) const | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | protected |
| findIterator(const NeighborhoodPair *np) | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | protected |
| findIterator(const NeighborhoodPair *np) const (defined in mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc >) | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | protected |
| findVertex(const vertex_t &v) | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | protected |
| findVertex(const vertex_t &v) const | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | protected |
| flag(const vertex_t &src, const vertex_t &neighbor) | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | |
| flagged(const vertex_t &src) const | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | |
| iAnyIn(const vertex_t &v) const | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | |
| iEmpty(const vertex_t &v) const | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | |
| in_edges_t typedef | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | protected |
| ineighbor_iterator typedef | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | |
| ineighbor_iterator_pair typedef | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | |
| iNeighbors(const vertex_t &v) | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | |
| iNeighbors(const vertex_t &v) const | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | |
| insert(const vertex_t &v) | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | |
| insert(iterator pos, const vertex_t &v) | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | |
| insert(Iterator first, Iterator last, bool check_unique=true) | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | |
| insert(const std::pair< Iterator, Iterator > &range, bool check_unique=true) | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | |
| insertEdge(const vertex_t &src, const vertex_t &tgt) | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | |
| insertInEdge(const vertex_t &v, const vertex_t &new_neighbor) | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | protected |
| int_const_neighbor_iterator typedef | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | protected |
| int_neighbor_iterator typedef | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | protected |
| iterator typedef | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | |
| iValence(const vertex_t &v) const | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | |
| lookup | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | protected |
| lookup_t typedef | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | |
| modified_vertices | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | protected |
| neighbor_found_t typedef | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | protected |
| neighbor_iterator typedef | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | |
| neighbor_iterator_pair typedef | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | |
| neighborhood | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | protected |
| neighborhood_t typedef | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | |
| neighborhood_value_type typedef | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | |
| neighbors(const vertex_t &v) const | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | |
| neighbors(const vertex_t &v) | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | |
| neighbors(const vertex_t &v, const vertex_t &n) | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | |
| neighbors(const vertex_t &v, const vertex_t &n) const | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | |
| nextTo(const vertex_t &v, const vertex_t &neighbor, unsigned int n=1) const | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | |
| np_alloc (defined in mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc >) | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | static |
| NPAlloc typedef (defined in mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc >) | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | |
| operator=(const VVGraph &other) | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | |
| operator==(const VVGraph &other) const | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | |
| operator[](size_type idx) const | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | |
| prevTo(const vertex_t &v, const vertex_t &ref, unsigned int n=1) const | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | |
| reference(vertex_t v) const | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | inline |
| replace(const vertex_t &v, const vertex_t &neighbor, const vertex_t &new_neighbor) | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | |
| reserve(size_type s) | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | inline |
| reverse() | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | |
| size() const | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | inline |
| size_type typedef | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | |
| source(const edge_t &edge) const | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | inline |
| spliceAfter(const vertex_t &v, const vertex_t &neighbor, const vertex_t &new_neighbor) | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | |
| spliceBefore(const vertex_t &v, const vertex_t &neighbor, const vertex_t &new_neighbor) | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | |
| subgraph(const VertexContainer &vertexes) const | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | |
| subgraph(const VertexContainer &verts) const (defined in mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc >) | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | |
| swap(VVGraph &other) | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | |
| target(const edge_t &edge) const | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | inline |
| undoInEdge(const vertex_t &new_neighbor, ineighbor_iterator &it) | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | protected |
| valence(const vertex_t &v) const | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | |
| value_type typedef | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | |
| vertex_t typedef (defined in mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc >) | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | |
| VertexAlloc typedef | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | |
| VVGraph() | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | inline |
| VVGraph(const VVGraph ©) | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | |
| VVGraph(Iterator begin, Iterator end, bool check_unique=true) | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | inline |
| VVGraph(const Container &c, bool check_unique=true) | mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc > | inline |