, including all inherited members.
any_vertex1() const | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [inline] |
any_vertex2() const | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [inline] |
anyIn(const vertex1_t &v) const | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [inline] |
anyIn(const vertex2_t &v) const | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | |
begin_vertex1() | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [inline] |
begin_vertex1() const | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [inline] |
begin_vertex2() | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [inline] |
begin_vertex2() const | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [inline] |
circ_neighbor_iterator1 typedef | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | |
circ_neighbor_iterator1_range typedef | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | |
circ_neighbor_iterator2 typedef | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | |
circ_neighbor_iterator2_range typedef | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | |
clear(const vertex1_t &v) | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [inline] |
clear(const vertex2_t &v) | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | |
clear() | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [inline] |
clear(iterator1 it) | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [inline] |
clear(iterator2 it) | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | |
const_circ_neighbor_iterator1 typedef | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | |
const_circ_neighbor_iterator1_range typedef | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | |
const_circ_neighbor_iterator2 typedef | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | |
const_circ_neighbor_iterator2_range typedef | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | |
const_edge1_t typedef | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | |
const_edge2_t typedef | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | |
const_iterator1 typedef | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | |
const_iterator2 typedef | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | |
const_neighbor1_found_t typedef | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [protected] |
const_neighbor2_found_t typedef | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [protected] |
const_neighbor_iterator1 typedef | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | |
const_neighbor_iterator1_range typedef | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | |
const_neighbor_iterator2 typedef | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | |
const_neighbor_iterator2_range typedef | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | |
const_range_vertex1 typedef | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | |
const_range_vertex2 typedef | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | |
contains(const vertex1_t &v) const | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [inline] |
contains(const vertex2_t &v) const | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | |
count(const vertex1_t &v) const | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [inline] |
count(const vertex2_t &v) const | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | |
edge(const vertex1_t &src, const vertex2_t &tgt) | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [inline] |
edge(const vertex2_t &src, const vertex1_t &tgt) | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | |
edge(const vertex1_t &src, const vertex2_t &tgt) const | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [inline] |
edge(const vertex2_t &src, const vertex1_t &tgt) const | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | |
edge1_t typedef | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | |
edge2_t typedef | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | |
edge_list1_t typedef | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [protected] |
edge_list2_t typedef | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [protected] |
EdgeCache1 typedef (defined in graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact >) | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [protected] |
EdgeCache2 typedef (defined in graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact >) | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [protected] |
empty() const | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [inline] |
empty(const vertex1_t &v) const | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [inline] |
empty(const vertex2_t &v) const | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | |
end_vertex1() | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [inline] |
end_vertex1() const | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [inline] |
end_vertex2() | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [inline] |
end_vertex2() const | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [inline] |
erase(const vertex1_t &v) | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [inline] |
erase(const vertex2_t &v) | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | |
erase(iterator1 pos) | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [inline] |
erase(iterator2 pos) | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | |
eraseAllEdges(const vertex1_t &v) | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [inline] |
eraseAllEdges(const vertex2_t &v) | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | |
eraseAllEdges() | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [inline] |
eraseAllEdges(iterator1 it) | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [inline] |
eraseAllEdges(iterator2 it) | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | |
eraseEdge(const vertex1_t &src, const vertex2_t &tgt) | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [inline] |
eraseEdge(const vertex2_t &src, const vertex1_t &tgt) | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | |
eraseEdge(const vertex1_t &v, neighbor_iterator1 pos) | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [inline] |
eraseEdge(const vertex1_t &v, circ_neighbor_iterator1 pos) | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [inline] |
eraseEdge(const vertex2_t &v, neighbor_iterator2 pos) | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | |
eraseEdge(const vertex2_t &v, circ_neighbor_iterator2 pos) | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | |
find(const vertex1_t &v) | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [inline] |
find(const vertex2_t &v) | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [inline] |
find(const vertex1_t &v) const | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [inline] |
find(const vertex2_t &v) const | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [inline] |
findIn(const vertex1_t &v, const vertex2_t &n) | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [inline] |
findIn(const vertex2_t &v, const vertex1_t &n) | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | |
findIn(const vertex1_t &v, const vertex2_t &n) const | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [inline] |
findIn(const vertex2_t &v, const vertex1_t &n) const | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | |
findInVertex(const vertex1_t &v, const vertex2_t &neighbor) | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [inline, protected] |
findInVertex(const vertex2_t &v, const vertex1_t &neighbor) | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [protected] |
findInVertex(const vertex1_t &v, const vertex2_t &neighbor) const | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [inline, protected] |
findInVertex(const vertex2_t &v, const vertex1_t &neighbor) const | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [protected] |
findVertex(const vertex1_t &v) | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [inline, protected] |
findVertex(const vertex2_t &v) | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [protected] |
findVertex(const vertex1_t &v) const | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [inline, protected] |
findVertex(const vertex2_t &v) const | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [protected] |
flag(const vertex1_t &src, const vertex2_t &neighbor) | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [inline] |
flag(const vertex2_t &src, const vertex1_t &neighbor) | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | |
flagged(const vertex1_t &src) const | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [inline] |
flagged(const vertex2_t &src) const | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | |
get_vertex1(size_type idx) const | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [inline] |
get_vertex2(size_type idx) const | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [inline] |
graph_id | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [protected] |
iAnyIn(const vertex1_t &v) const | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [inline] |
iAnyIn(const vertex2_t &v) const | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | |
iEmpty(const vertex1_t &v) const | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [inline] |
iEmpty(const vertex2_t &v) const | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | |
in_edges1_t typedef | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [protected] |
in_edges2_t typedef | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [protected] |
ineighbor_iterator1 typedef | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | |
ineighbor_iterator1_range typedef | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | |
ineighbor_iterator2 typedef | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | |
ineighbor_iterator2_range typedef | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | |
iNeighbors(const vertex1_t &v) const | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [inline] |
iNeighbors(const vertex2_t &v) const | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | |
insert(const vertex1_t &v) | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [inline] |
insert(const vertex2_t &v) | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | |
insert(iterator1 pos, const vertex1_t &v) | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [inline] |
insert(iterator2 pos, const vertex2_t &v) | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | |
insert(iterator1 first, iterator1 last) | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [inline] |
insert(iterator2 first, iterator2 last) | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | |
insertEdge(const vertex1_t &src, const vertex2_t &tgt) | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [inline] |
insertEdge(const vertex2_t &src, const vertex1_t &tgt) | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | |
insertInEdge(const vertex1_t &v, const vertex2_t &new_neighbor) | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [inline, protected] |
insertInEdge(const vertex2_t &v, const vertex1_t &new_neighbor) | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [protected] |
int_const_neighbor_iterator1 typedef | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [protected] |
int_const_neighbor_iterator2 typedef | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [protected] |
int_neighbor_iterator1 typedef | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [protected] |
int_neighbor_iterator2 typedef | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [protected] |
iterator1 typedef | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | |
iterator2 typedef | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | |
iValence(const vertex1_t &v) const | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [inline] |
iValence(const vertex2_t &v) const | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | |
lookup1 | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [protected] |
lookup1_t typedef | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | |
lookup2 | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [protected] |
lookup2_t typedef | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | |
nb_vertices1() const | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [inline] |
nb_vertices2() const | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [inline] |
neighbor1_found_t typedef | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [protected] |
neighbor1_t typedef | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [protected] |
neighbor2_found_t typedef | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [protected] |
neighbor2_t typedef | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [protected] |
neighbor_iterator1 typedef | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | |
neighbor_iterator1_range typedef | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | |
neighbor_iterator2 typedef | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | |
neighbor_iterator2_range typedef | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | |
neighborhood1 | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [protected] |
neighborhood1_t typedef | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | |
neighborhood1_value_type typedef | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | |
neighborhood2 | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [protected] |
neighborhood2_t typedef | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | |
neighborhood2_value_type typedef | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | |
neighbors(const vertex1_t &v) const | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [inline] |
neighbors(const vertex2_t &v) const | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | |
neighbors(const vertex1_t &v) | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [inline] |
neighbors(const vertex2_t &v) | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | |
neighbors(const vertex1_t &v, const vertex2_t &n) const | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [inline] |
neighbors(const vertex2_t &v, const vertex1_t &n) const | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | |
neighbors(const vertex1_t &v, const vertex2_t &n) | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [inline] |
neighbors(const vertex2_t &v, const vertex1_t &n) | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | |
nextTo(const vertex1_t &v, const vertex2_t &neighbor, unsigned int n=1) const | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [inline] |
nextTo(const vertex2_t &v, const vertex1_t &neighbor, unsigned int n=1) const | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | |
no_vertex1() const | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [inline] |
no_vertex2() const | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [inline] |
operator=(const VVBiGraph &other) | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [inline] |
operator==(const VVBiGraph &other) const | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [inline] |
prevTo(const vertex1_t &v, const vertex2_t &ref, unsigned int n=1) const | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [inline] |
prevTo(const vertex2_t &v, const vertex1_t &ref, unsigned int n=1) const | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | |
range_vertex1 typedef | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | |
range_vertex2 typedef | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | |
reference(vertex1_t v) const | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [inline] |
reference(vertex2_t v) const | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [inline] |
replace(const vertex1_t &v, const vertex2_t &neighbor, const vertex2_t &new_neighbor) | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [inline] |
replace(const vertex2_t &v, const vertex1_t &neighbor, const vertex1_t &new_neighbor) | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | |
single_neighborhood1_t typedef | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [protected] |
single_neighborhood2_t typedef | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [protected] |
size() const | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [inline] |
size_type typedef | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | |
source(const edge1_t &edge) const | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [inline] |
source(const edge2_t &edge) const | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [inline] |
spliceAfter(const vertex1_t &v, const vertex2_t &neighbor, const vertex2_t &new_neighbor) | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [inline] |
spliceAfter(const vertex2_t &v, const vertex1_t &neighbor, const vertex1_t &new_neighbor) | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | |
spliceBefore(const vertex1_t &v, const vertex2_t &neighbor, const vertex2_t &new_neighbor) | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [inline] |
spliceBefore(const vertex2_t &v, const vertex1_t &neighbor, const vertex1_t &new_neighbor) | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | |
subgraph(const Vertex1Container &vertices1, const Vertex2Container &vertices2) const (defined in graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact >) | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [inline] |
swap(VVBiGraph &other) | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [inline] |
target(const edge1_t &edge) const | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [inline] |
target(const edge2_t &edge) const | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [inline] |
undoInEdge(const vertex1_t &new_neighbor, ineighbor_iterator1 &it) | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [inline, protected] |
undoInEdge(const vertex2_t &new_neighbor, ineighbor_iterator2 &it) | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [inline, protected] |
updateEdgeCache(const vertex1_t &v, typename edge_list1_t::iterator new_edge_it, const vertex1_t &in_edge) | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [inline, protected] |
updateEdgeCache(const vertex2_t &v, typename edge_list2_t::iterator new_edge_it, const vertex2_t &in_edge) | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [protected] |
updateVertexCache(const vertex1_t &v, typename neighborhood1_t::iterator it) | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [inline, protected] |
updateVertexCache(const vertex2_t &v, typename neighborhood2_t::iterator it) | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [inline, protected] |
valence(const vertex1_t &v) const | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [inline] |
valence(const vertex2_t &v) const | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | |
vertex1_t typedef | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | |
vertex2_t typedef | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | |
VertexCache1 typedef (defined in graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact >) | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [protected] |
VertexCache2 typedef (defined in graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact >) | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [protected] |
vertices1() const | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [inline] |
vertices1() | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [inline] |
vertices2() const | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [inline] |
vertices2() | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [inline] |
VVBiGraph() | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [inline] |
VVBiGraph(const VVBiGraph ©) | graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | [inline] |