, including all inherited members.
any() const | graph::VVGraph< VertexContent, EdgeContent, compact > | [inline] |
anyIn(const vertex_t &v) const | graph::VVGraph< VertexContent, EdgeContent, compact > | [inline] |
arc(const vertex_t &src, const vertex_t &tgt) | graph::VVGraph< VertexContent, EdgeContent, compact > | [inline] |
arc_t typedef | graph::VVGraph< VertexContent, EdgeContent, compact > | |
begin() | graph::VVGraph< VertexContent, EdgeContent, compact > | [inline] |
begin() const | graph::VVGraph< VertexContent, EdgeContent, compact > | [inline] |
circ_neighbor_iterator typedef | graph::VVGraph< VertexContent, EdgeContent, compact > | |
circ_neighbor_iterator_range typedef | graph::VVGraph< VertexContent, EdgeContent, compact > | |
clear(const vertex_t &v) | graph::VVGraph< VertexContent, EdgeContent, compact > | [inline] |
clear() | graph::VVGraph< VertexContent, EdgeContent, compact > | [inline] |
clear(iterator it) | graph::VVGraph< VertexContent, EdgeContent, compact > | [inline] |
const_circ_neighbor_iterator typedef | graph::VVGraph< VertexContent, EdgeContent, compact > | |
const_circ_neighbor_iterator_range typedef | graph::VVGraph< VertexContent, EdgeContent, compact > | |
const_edge_t typedef | graph::VVGraph< VertexContent, EdgeContent, compact > | |
const_iterator typedef | graph::VVGraph< VertexContent, EdgeContent, compact > | |
const_neighbor_found_t typedef | graph::VVGraph< VertexContent, EdgeContent, compact > | [protected] |
const_neighbor_iterator typedef | graph::VVGraph< VertexContent, EdgeContent, compact > | |
const_neighbor_iterator_range typedef | graph::VVGraph< VertexContent, EdgeContent, compact > | |
contains(const vertex_t &v) const | graph::VVGraph< VertexContent, EdgeContent, compact > | [inline] |
count(const vertex_t &v) const | graph::VVGraph< VertexContent, EdgeContent, compact > | [inline] |
edge(const vertex_t &src, const vertex_t &tgt) | graph::VVGraph< VertexContent, EdgeContent, compact > | [inline] |
edge(const vertex_t &src, const vertex_t &tgt) const | graph::VVGraph< VertexContent, EdgeContent, compact > | [inline] |
edge_list_t typedef | graph::VVGraph< VertexContent, EdgeContent, compact > | [protected] |
edge_t typedef | graph::VVGraph< VertexContent, EdgeContent, compact > | |
EdgeCache typedef (defined in graph::VVGraph< VertexContent, EdgeContent, compact >) | graph::VVGraph< VertexContent, EdgeContent, compact > | [protected] |
empty() const | graph::VVGraph< VertexContent, EdgeContent, compact > | [inline] |
empty(const vertex_t &v) const | graph::VVGraph< VertexContent, EdgeContent, compact > | [inline] |
end() | graph::VVGraph< VertexContent, EdgeContent, compact > | [inline] |
end() const | graph::VVGraph< VertexContent, EdgeContent, compact > | [inline] |
erase(const vertex_t &v) | graph::VVGraph< VertexContent, EdgeContent, compact > | [inline] |
erase(iterator pos) | graph::VVGraph< VertexContent, EdgeContent, compact > | [inline] |
eraseAllEdges(const vertex_t &v) | graph::VVGraph< VertexContent, EdgeContent, compact > | [inline] |
eraseAllEdges() | graph::VVGraph< VertexContent, EdgeContent, compact > | [inline] |
eraseAllEdges(iterator it) | graph::VVGraph< VertexContent, EdgeContent, compact > | [inline] |
eraseEdge(const vertex_t &src, const vertex_t &tgt) | graph::VVGraph< VertexContent, EdgeContent, compact > | [inline] |
eraseEdge(const vertex_t &v, neighbor_iterator pos) | graph::VVGraph< VertexContent, EdgeContent, compact > | [inline] |
eraseEdge(const vertex_t &v, circ_neighbor_iterator pos) | graph::VVGraph< VertexContent, EdgeContent, compact > | [inline] |
find(const vertex_t &v) | graph::VVGraph< VertexContent, EdgeContent, compact > | [inline] |
find(const vertex_t &v) const | graph::VVGraph< VertexContent, EdgeContent, compact > | [inline] |
findIn(const vertex_t &v, const vertex_t &n) | graph::VVGraph< VertexContent, EdgeContent, compact > | [inline] |
findIn(const vertex_t &v, const vertex_t &n) const | graph::VVGraph< VertexContent, EdgeContent, compact > | [inline] |
findInVertex(const vertex_t &v, const vertex_t &neighbor) | graph::VVGraph< VertexContent, EdgeContent, compact > | [inline, protected] |
findInVertex(const vertex_t &v, const vertex_t &neighbor) const | graph::VVGraph< VertexContent, EdgeContent, compact > | [inline, protected] |
findVertex(const vertex_t &v) | graph::VVGraph< VertexContent, EdgeContent, compact > | [inline, protected] |
findVertex(const vertex_t &v) const | graph::VVGraph< VertexContent, EdgeContent, compact > | [inline, protected] |
flag(const vertex_t &src, const vertex_t &neighbor) | graph::VVGraph< VertexContent, EdgeContent, compact > | [inline] |
flagged(const vertex_t &src) const | graph::VVGraph< VertexContent, EdgeContent, compact > | [inline] |
graph_id | graph::VVGraph< VertexContent, EdgeContent, compact > | [protected] |
iAnyIn(const vertex_t &v) const | graph::VVGraph< VertexContent, EdgeContent, compact > | [inline] |
iEmpty(const vertex_t &v) const | graph::VVGraph< VertexContent, EdgeContent, compact > | [inline] |
in_edges_t typedef | graph::VVGraph< VertexContent, EdgeContent, compact > | [protected] |
ineighbor_iterator typedef | graph::VVGraph< VertexContent, EdgeContent, compact > | |
ineighbor_iterator_range typedef | graph::VVGraph< VertexContent, EdgeContent, compact > | |
iNeighbors(const vertex_t &v) const | graph::VVGraph< VertexContent, EdgeContent, compact > | [inline] |
insert(const vertex_t &v) | graph::VVGraph< VertexContent, EdgeContent, compact > | [inline] |
insert(iterator pos, const vertex_t &v) | graph::VVGraph< VertexContent, EdgeContent, compact > | [inline] |
insert(Iterator first, Iterator last) | graph::VVGraph< VertexContent, EdgeContent, compact > | [inline] |
insertEdge(const vertex_t &src, const vertex_t &tgt) | graph::VVGraph< VertexContent, EdgeContent, compact > | [inline] |
insertEdges(const vertex_t &src, const VertexContainer &targets) | graph::VVGraph< VertexContent, EdgeContent, compact > | [inline] |
insertInEdge(const vertex_t &v, const vertex_t &new_neighbor) | graph::VVGraph< VertexContent, EdgeContent, compact > | [inline, protected] |
int_const_neighbor_iterator typedef | graph::VVGraph< VertexContent, EdgeContent, compact > | [protected] |
int_neighbor_iterator typedef | graph::VVGraph< VertexContent, EdgeContent, compact > | [protected] |
iterator typedef | graph::VVGraph< VertexContent, EdgeContent, compact > | |
iValence(const vertex_t &v) const | graph::VVGraph< VertexContent, EdgeContent, compact > | [inline] |
lookup | graph::VVGraph< VertexContent, EdgeContent, compact > | [protected] |
lookup_t typedef | graph::VVGraph< VertexContent, EdgeContent, compact > | |
neighbor_found_t typedef | graph::VVGraph< VertexContent, EdgeContent, compact > | [protected] |
neighbor_iterator typedef | graph::VVGraph< VertexContent, EdgeContent, compact > | |
neighbor_iterator_range typedef | graph::VVGraph< VertexContent, EdgeContent, compact > | |
neighborhood | graph::VVGraph< VertexContent, EdgeContent, compact > | [protected] |
neighborhood_t typedef | graph::VVGraph< VertexContent, EdgeContent, compact > | |
neighborhood_value_type typedef | graph::VVGraph< VertexContent, EdgeContent, compact > | |
neighbors(const vertex_t &v) const | graph::VVGraph< VertexContent, EdgeContent, compact > | [inline] |
neighbors(const vertex_t &v) | graph::VVGraph< VertexContent, EdgeContent, compact > | [inline] |
neighbors(const vertex_t &v, const vertex_t &n) | graph::VVGraph< VertexContent, EdgeContent, compact > | [inline] |
neighbors(const vertex_t &v, const vertex_t &n) const | graph::VVGraph< VertexContent, EdgeContent, compact > | [inline] |
nextTo(const vertex_t &v, const vertex_t &neighbor, unsigned int n=1) const | graph::VVGraph< VertexContent, EdgeContent, compact > | [inline] |
operator=(const VVGraph &other) | graph::VVGraph< VertexContent, EdgeContent, compact > | [inline] |
operator==(const VVGraph &other) const | graph::VVGraph< VertexContent, EdgeContent, compact > | [inline] |
operator[](size_type idx) const | graph::VVGraph< VertexContent, EdgeContent, compact > | [inline] |
prevTo(const vertex_t &v, const vertex_t &ref, unsigned int n=1) const | graph::VVGraph< VertexContent, EdgeContent, compact > | [inline] |
reference(vertex_t v) const | graph::VVGraph< VertexContent, EdgeContent, compact > | [inline] |
replace(const vertex_t &v, const vertex_t &neighbor, const vertex_t &new_neighbor) | graph::VVGraph< VertexContent, EdgeContent, compact > | [inline] |
size() const | graph::VVGraph< VertexContent, EdgeContent, compact > | [inline] |
size_type typedef | graph::VVGraph< VertexContent, EdgeContent, compact > | |
source(const edge_t &edge) const | graph::VVGraph< VertexContent, EdgeContent, compact > | [inline] |
source(const arc_t &arc) const (defined in graph::VVGraph< VertexContent, EdgeContent, compact >) | graph::VVGraph< VertexContent, EdgeContent, compact > | [inline] |
spliceAfter(const vertex_t &v, const vertex_t &neighbor, const vertex_t &new_neighbor) | graph::VVGraph< VertexContent, EdgeContent, compact > | [inline] |
spliceAfter(const vertex_t &v, const vertex_t &neighbor, const VertexContainer &new_neighbor) | graph::VVGraph< VertexContent, EdgeContent, compact > | [inline] |
spliceBefore(const vertex_t &v, const vertex_t &neighbor, const vertex_t &new_neighbor) | graph::VVGraph< VertexContent, EdgeContent, compact > | [inline] |
spliceBefore(const vertex_t &v, const vertex_t &neighbor, const VertexContainer &new_neighbor) | graph::VVGraph< VertexContent, EdgeContent, compact > | [inline] |
store_vertices(std::vector< vertex_t > &vertices, bool cached=true) const | graph::VVGraph< VertexContent, EdgeContent, compact > | [inline] |
subgraph(const VertexContainer &vertexes) const | graph::VVGraph< VertexContent, EdgeContent, compact > | [inline] |
swap(VVGraph &other) | graph::VVGraph< VertexContent, EdgeContent, compact > | [inline] |
target(const edge_t &edge) const | graph::VVGraph< VertexContent, EdgeContent, compact > | [inline] |
target(const arc_t &arc) const (defined in graph::VVGraph< VertexContent, EdgeContent, compact >) | graph::VVGraph< VertexContent, EdgeContent, compact > | [inline] |
undoInEdge(const vertex_t &new_neighbor, ineighbor_iterator &it) | graph::VVGraph< VertexContent, EdgeContent, compact > | [inline, protected] |
updateEdgeCache(const vertex_t &v, typename edge_list_t::iterator new_edge_it, const vertex_t &in_edge) | graph::VVGraph< VertexContent, EdgeContent, compact > | [inline, protected] |
updateVertexCache(const vertex_t &v, typename neighborhood_t::iterator it) | graph::VVGraph< VertexContent, EdgeContent, compact > | [inline, protected] |
valence(const vertex_t &v) const | graph::VVGraph< VertexContent, EdgeContent, compact > | [inline] |
value_type typedef | graph::VVGraph< VertexContent, EdgeContent, compact > | |
vertex_t typedef | graph::VVGraph< VertexContent, EdgeContent, compact > | |
VertexCache typedef (defined in graph::VVGraph< VertexContent, EdgeContent, compact >) | graph::VVGraph< VertexContent, EdgeContent, compact > | [protected] |
VVGraph() | graph::VVGraph< VertexContent, EdgeContent, compact > | [inline] |
VVGraph(const VVGraph ©) | graph::VVGraph< VertexContent, EdgeContent, compact > | [inline] |