Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
Loading...
Searching...
No Matches
Aleph::Euclidian_Graph< __Euclidian_Node, __Euclidian_Arc > Member List

This is the complete list of members for Aleph::Euclidian_Graph< __Euclidian_Node, __Euclidian_Arc >, including all inherited members.

adjacent_nodes(Node *p) constGraphCommon< GT, Node, Arc >inline
all_arcs(Operation &op) constGraphCommon< GT, Node, Arc >inline
all_arcs(Operation &&op=Operation()) constGraphCommon< GT, Node, Arc >inline
all_arcs(Node *p, Operation &op) constGraphCommon< GT, Node, Arc >inline
all_arcs(Node *p, Operation &&op=Operation()) constGraphCommon< GT, Node, Arc >inline
all_in_arcs(Node *p, Op &op) constGraphCommon< GT, Node, Arc >inline
all_in_arcs(Node *p, Op &&op=Op()) constGraphCommon< GT, Node, Arc >inline
all_nodes(Operation &op) constGraphCommon< GT, Node, Arc >inline
all_nodes(Operation &&op=Operation()) constGraphCommon< GT, Node, Arc >inline
all_out_arcs(Node *p, Op &op) constGraphCommon< GT, Node, Arc >inline
all_out_arcs(Node *p, Op &&op=Op()) constGraphCommon< GT, Node, Arc >inline
Arc typedefAleph::Euclidian_Graph< __Euclidian_Node, __Euclidian_Arc >
arc_listAleph::List_Graph< __Euclidian_Node, __Euclidian_Arc >private
Arc_Type typedefAleph::Euclidian_Graph< __Euclidian_Node, __Euclidian_Arc >
ArcPair typedefGraphCommon< GT, Node, Arc >
arcs() constGraphCommon< GT, Node, Arc >inline
arcs(Node *p) constGraphCommon< GT, Node, Arc >inline
arcs_map(std::function< T(Arc *)> operation) constGraphCommon< GT, Node, Arc >inline
arcs_map(Node *p, std::function< T(Arc *)> operation) constGraphCommon< GT, Node, Arc >inline
collect_arcs_if(Predicate pred) constGraphCommon< GT, Node, Arc >inlineprotected
common_swap(GT &g) noexceptGraphCommon< GT, Node, Arc >inlineprotected
CommonBase typedefAleph::List_Graph< __Euclidian_Node, __Euclidian_Arc >
connect_arc(Arc *arc) noexceptAleph::List_Graph< __Euclidian_Node, __Euclidian_Arc >inlinevirtual
const_me() constGraphCommon< GT, Node, Arc >inlineprivate
cookieGraphCommon< GT, Node, Arc >protected
count_arcs(Operation op=[](Arc *) { return true;}) constGraphCommon< GT, Node, Arc >inline
count_arcs(Node *p, Operation op=[](Arc *) { return true;}) constGraphCommon< GT, Node, Arc >inline
count_nodes(Operation op=[](Node *) { return true;}) constGraphCommon< GT, Node, Arc >inline
degree(Node *p) const noexceptGraphCommon< GT, Node, Arc >inline
digraphGraphCommon< GT, Node, Arc >protected
disconnect_arc(Arc *arc) noexceptAleph::List_Graph< __Euclidian_Node, __Euclidian_Arc >inlinevirtual
dlink_to_arc(Dlink *p) noexceptAleph::List_Graph< __Euclidian_Node, __Euclidian_Arc >inlineprivatestatic
dlink_to_arc_node(Dlink *p) noexceptAleph::List_Graph< __Euclidian_Node, __Euclidian_Arc >inlineprivatestatic
dlink_to_node(Dlink *p) noexceptAleph::List_Graph< __Euclidian_Node, __Euclidian_Arc >inlineprivatestatic
emplace_arc(Node *src, Node *tgt, Args &&... args)GraphCommon< GT, Node, Arc >inline
emplace_node(Args &&... args)GraphCommon< GT, Node, Arc >inline
esize() const noexceptGraphCommon< GT, Node, Arc >inline
Euclidian_Graph()Aleph::Euclidian_Graph< __Euclidian_Node, __Euclidian_Arc >inline
Euclidian_Graph(const Euclidian_Graph< Node, Arc > &euclidian_graph)Aleph::Euclidian_Graph< __Euclidian_Node, __Euclidian_Arc >inline
exists_arc(Operation &op) constGraphCommon< GT, Node, Arc >inline
exists_arc(Operation &&op=Operation()) constGraphCommon< GT, Node, Arc >inline
exists_arc(Node *p, Operation &op) constGraphCommon< GT, Node, Arc >inline
exists_arc(Node *p, Operation &&op=Operation()) constGraphCommon< GT, Node, Arc >inline
exists_in_arc(Node *p, Op &op) constGraphCommon< GT, Node, Arc >inline
exists_in_arc(Node *p, Op &&op=Op()) constGraphCommon< GT, Node, Arc >inline
exists_node(Operation &op) constGraphCommon< GT, Node, Arc >inline
exists_node(Operation &&op=Operation()) constGraphCommon< GT, Node, Arc >inline
exists_out_arc(Node *p, Op &op) constGraphCommon< GT, Node, Arc >inline
exists_out_arc(Node *p, Op &&op=Op()) constGraphCommon< GT, Node, Arc >inline
filter_arcs(Op &op) constGraphCommon< GT, Node, Arc >inline
filter_arcs(Op &&op) constGraphCommon< GT, Node, Arc >inline
filter_arcs(Node *p, Op &op) constGraphCommon< GT, Node, Arc >inline
filter_arcs(Node *p, Op &&op) constGraphCommon< GT, Node, Arc >inline
filter_in_arcs(Node *p, Op &op) constGraphCommon< GT, Node, Arc >inline
filter_in_arcs(Node *p, Op &&op=Op()) constGraphCommon< GT, Node, Arc >inline
filter_nodes(Op &op) constGraphCommon< GT, Node, Arc >inline
filter_nodes(Op &&op) constGraphCommon< GT, Node, Arc >inline
filter_out_arcs(Node *p, Op &op) constGraphCommon< GT, Node, Arc >inline
filter_out_arcs(Node *p, Op &&op=Op()) constGraphCommon< GT, Node, Arc >inline
find_arc(const Arc_Type &info) const noexceptGraphCommon< GT, Node, Arc >inline
find_node(const Node_Type &info) const noexceptGraphCommon< GT, Node, Arc >inline
foldl_arcs(const T &init, std::function< T(const T &, Arc *)> op) constGraphCommon< GT, Node, Arc >inline
foldl_arcs(Node *p, const T &init, std::function< T(const T &, Arc *)> op) constGraphCommon< GT, Node, Arc >inline
foldl_in_arcs(Node *p, const T &init, std::function< T(const T &, Arc *)> op) constGraphCommon< GT, Node, Arc >inline
foldl_nodes(const T &init, std::function< T(const T &, Node *)> op) constGraphCommon< GT, Node, Arc >inline
foldl_out_arcs(Node *p, const T &init, std::function< T(const T &, Arc *)> op) constGraphCommon< GT, Node, Arc >inline
for_each_arc(Operation &op) constGraphCommon< GT, Node, Arc >inline
for_each_arc(Operation &&operation=Operation()) constGraphCommon< GT, Node, Arc >inline
for_each_arc(Node *p, Operation &op) constGraphCommon< GT, Node, Arc >inline
for_each_arc(Node *p, Operation &&op=Operation()) constGraphCommon< GT, Node, Arc >inline
for_each_arc(Node *p, Operation &op) constGraphCommon< GT, Node, Arc >inline
for_each_in_arc(Node *p, Op &op) constGraphCommon< GT, Node, Arc >inline
for_each_in_arc(Node *p, Op &&op=Op()) constGraphCommon< GT, Node, Arc >inline
for_each_node(Operation &operation) constGraphCommon< GT, Node, Arc >inline
for_each_node(Operation &&operation=Operation()) constGraphCommon< GT, Node, Arc >inline
for_each_out_arc(Node *p, Op &op) constGraphCommon< GT, Node, Arc >inline
for_each_out_arc(Node *p, Op &&op=Op()) constGraphCommon< GT, Node, Arc >inline
get_arc() constGraphCommon< GT, Node, Arc >inline
get_arc(Node *p)GraphCommon< GT, Node, Arc >inline
get_arc_dlink() noexceptAleph::List_Graph< __Euclidian_Node, __Euclidian_Arc >inline
get_arc_it() const noexceptGraphCommon< GT, Node, Arc >inline
get_arc_it(Node *p) const noexceptGraphCommon< GT, Node, Arc >inline
get_bit(Node *node, int bit) const noexceptGraphCommon< GT, Node, Arc >inline
get_bit(Arc *arc, int bit) const noexceptGraphCommon< GT, Node, Arc >inline
get_connected_node(Arc *arc, Node *node) const noexceptGraphCommon< GT, Node, Arc >inline
get_control_bits(Node *node) const noexceptGraphCommon< GT, Node, Arc >inline
get_control_bits(Arc *arc) const noexceptGraphCommon< GT, Node, Arc >inline
get_cookie() noexceptGraphCommon< GT, Node, Arc >inline
get_cookie() const noexceptGraphCommon< GT, Node, Arc >inline
get_cookie(Node *node) const noexceptGraphCommon< GT, Node, Arc >inline
get_cookie(Arc *arc) const noexceptGraphCommon< GT, Node, Arc >inline
get_counter(Node *node) const noexceptGraphCommon< GT, Node, Arc >inline
get_counter(Arc *arc) const noexceptGraphCommon< GT, Node, Arc >inline
get_distance(Arc *arc)Aleph::Euclidian_Graph< __Euclidian_Node, __Euclidian_Arc >inline
get_first_arc(Node *node) constAleph::List_Graph< __Euclidian_Node, __Euclidian_Arc >inline
get_first_arc() constAleph::List_Graph< __Euclidian_Node, __Euclidian_Arc >inline
get_first_node() constAleph::List_Graph< __Euclidian_Node, __Euclidian_Arc >inline
get_in_it(Node *p) const noexceptGraphCommon< GT, Node, Arc >inline
get_node() constGraphCommon< GT, Node, Arc >inline
get_node_dlink() noexceptAleph::List_Graph< __Euclidian_Node, __Euclidian_Arc >inline
get_node_it() const noexceptGraphCommon< GT, Node, Arc >inline
get_num_arcs() const noexceptGraphCommon< GT, Node, Arc >inline
get_num_arcs(Node *node) const noexceptGraphCommon< GT, Node, Arc >inline
get_num_nodes() const noexceptGraphCommon< GT, Node, Arc >inline
get_out_it(Node *p) const noexceptGraphCommon< GT, Node, Arc >inline
get_src_node(Arc *arc) const noexceptGraphCommon< GT, Node, Arc >inline
get_tgt_node(Arc *arc) const noexceptGraphCommon< GT, Node, Arc >inline
Graph typedefAleph::Euclidian_Graph< __Euclidian_Node, __Euclidian_Arc >
GT typedefAleph::List_Graph< __Euclidian_Node, __Euclidian_Arc >
has_arc_dlink_vGraphCommon< GT, Node, Arc >static
has_node_dlink_vGraphCommon< GT, Node, Arc >static
in_arcs(Node *p) constGraphCommon< GT, Node, Arc >inline
in_arcs_map(Node *p, std::function< T(Arc *)> op) constGraphCommon< GT, Node, Arc >inline
in_degree(Node *p) const noexceptGraphCommon< GT, Node, Arc >inline
in_nodes(Node *p) constGraphCommon< GT, Node, Arc >inline
in_pairs(Node *p) constGraphCommon< GT, Node, Arc >inline
init() noexceptGraphCommon< GT, Node, Arc >inlineprotected
insert_arc(Node *src_node, Node *tgt_node, void *a)Aleph::List_Graph< __Euclidian_Node, __Euclidian_Arc >inlineprivate
insert_arc(Node *src, Node *tgt, const Arc_Type &arc_info)Aleph::List_Graph< __Euclidian_Node, __Euclidian_Arc >inline
insert_arc(Node *src, Node *tgt, Arc_Type &&arc_info=Arc_Type())Aleph::List_Graph< __Euclidian_Node, __Euclidian_Arc >inline
GraphCommon::insert_arc(Node *src, Node *tgt, const Arc_Type &arc_info)GraphCommon< GT, Node, Arc >inline
GraphCommon::insert_arc(Node *src, Node *tgt, Arc_Type &&arc_info=Arc_Type())GraphCommon< GT, Node, Arc >inline
insert_node(Node *node) noexcept overrideAleph::Euclidian_Graph< __Euclidian_Node, __Euclidian_Arc >inlinevirtual
insert_node(const Node_Type &info)Aleph::Euclidian_Graph< __Euclidian_Node, __Euclidian_Arc >inline
insert_node(const Point &position)Aleph::Euclidian_Graph< __Euclidian_Node, __Euclidian_Arc >inline
insert_node(const Node_Type &info, const Point &position)Aleph::Euclidian_Graph< __Euclidian_Node, __Euclidian_Arc >inline
List_Graph< __Euclidian_Node, __Euclidian_Arc >::insert_node(Node_Type &&node_info=Node_Type())Aleph::List_Graph< __Euclidian_Node, __Euclidian_Arc >inline
is_digraph() const noexceptGraphCommon< GT, Node, Arc >inline
List_Graph(const List_Graph &g)Aleph::List_Graph< __Euclidian_Node, __Euclidian_Arc >inline
List_Graph(List_Graph &&g) noexceptAleph::List_Graph< __Euclidian_Node, __Euclidian_Arc >inline
List_Graph()=defaultAleph::List_Graph< __Euclidian_Node, __Euclidian_Arc >
map_arcs(A1 *p, A2 *q) noexceptGraphCommon< GT, Node, Arc >inlinestatic
map_nodes(N1 *p, N2 *q) noexceptGraphCommon< GT, Node, Arc >inlinestatic
max_arc(Node *p, Compare cmp=[](Arc *a, Arc *b) { return a->get_info()< b->get_info();}) constGraphCommon< GT, Node, Arc >inline
max_arc(Compare cmp=[](Arc *a, Arc *b) { return a->get_info()< b->get_info();}) constGraphCommon< GT, Node, Arc >inline
me()GraphCommon< GT, Node, Arc >inlineprivate
min_arc(Node *p, Compare cmp=[](Arc *a, Arc *b) { return a->get_info()< b->get_info();}) constGraphCommon< GT, Node, Arc >inline
min_arc(Compare cmp=[](Arc *a, Arc *b) { return a->get_info()< b->get_info();}) constGraphCommon< GT, Node, Arc >inline
Node typedefAleph::Euclidian_Graph< __Euclidian_Node, __Euclidian_Arc >
node_listAleph::List_Graph< __Euclidian_Node, __Euclidian_Arc >private
Node_Type typedefAleph::Euclidian_Graph< __Euclidian_Node, __Euclidian_Arc >
nodes() constGraphCommon< GT, Node, Arc >inline
nodes_map(std::function< T(Node *)> op) constGraphCommon< GT, Node, Arc >inline
none_arc(Operation &op) constGraphCommon< GT, Node, Arc >inline
none_arc(Operation &&op) constGraphCommon< GT, Node, Arc >inline
none_arc(Node *p, Operation &op) constGraphCommon< GT, Node, Arc >inline
none_arc(Node *p, Operation &&op) constGraphCommon< GT, Node, Arc >inline
none_node(Operation &op) constGraphCommon< GT, Node, Arc >inline
none_node(Operation &&op) constGraphCommon< GT, Node, Arc >inline
num_arcsGraphCommon< GT, Node, Arc >protected
num_nodesGraphCommon< GT, Node, Arc >protected
operator=(Euclidian_Graph< Node, Arc > &eg)Aleph::Euclidian_Graph< __Euclidian_Node, __Euclidian_Arc >inline
List_Graph< __Euclidian_Node, __Euclidian_Arc >::operator=(const List_Graph &g)Aleph::List_Graph< __Euclidian_Node, __Euclidian_Arc >inline
List_Graph< __Euclidian_Node, __Euclidian_Arc >::operator=(List_Graph &&g) noexceptAleph::List_Graph< __Euclidian_Node, __Euclidian_Arc >inline
out_arcs(Node *p) constGraphCommon< GT, Node, Arc >inline
out_arcs_map(Node *p, std::function< T(Arc *)> op) constGraphCommon< GT, Node, Arc >inline
out_degree(Node *p) const noexceptGraphCommon< GT, Node, Arc >inline
out_nodes(Node *p) constGraphCommon< GT, Node, Arc >inline
out_pairs(Node *p) constGraphCommon< GT, Node, Arc >inline
partition_arcs(Operation op) constGraphCommon< GT, Node, Arc >inline
partition_nodes(Operation op) constGraphCommon< GT, Node, Arc >inline
remove_arc(Arc *arc) noexceptAleph::List_Graph< __Euclidian_Node, __Euclidian_Arc >inlinevirtual
remove_arcs_if(Predicate pred)GraphCommon< GT, Node, Arc >inlineprotected
remove_node(Node *node) noexceptAleph::List_Graph< __Euclidian_Node, __Euclidian_Arc >inlinevirtual
reset_arc(Arc *arc) const noexceptGraphCommon< GT, Node, Arc >inline
reset_arc_counters() const noexceptGraphCommon< GT, Node, Arc >inline
reset_arcs() constGraphCommon< GT, Node, Arc >inline
reset_bit(Node *node, int bit) const noexceptGraphCommon< GT, Node, Arc >inline
reset_bit(Arc *arc, int bit) const noexceptGraphCommon< GT, Node, Arc >inline
reset_bit_arcs(int bit) const noexceptGraphCommon< GT, Node, Arc >inline
reset_bit_arcs() const noexceptGraphCommon< GT, Node, Arc >inline
reset_bit_nodes(int bit) const noexceptGraphCommon< GT, Node, Arc >inline
reset_bit_nodes() const noexceptGraphCommon< GT, Node, Arc >inline
reset_bits(Node *node) const noexceptGraphCommon< GT, Node, Arc >inline
reset_bits(Arc *arc) const noexceptGraphCommon< GT, Node, Arc >inline
reset_cookie_arcs() const noexceptGraphCommon< GT, Node, Arc >inline
reset_cookie_nodes() const noexceptGraphCommon< GT, Node, Arc >inline
reset_counter(Node *node) const noexceptGraphCommon< GT, Node, Arc >inline
reset_counter(Arc *arc) const noexceptGraphCommon< GT, Node, Arc >inline
reset_counter_arcs() const noexceptGraphCommon< GT, Node, Arc >inline
reset_counter_nodes() const noexceptGraphCommon< GT, Node, Arc >inline
reset_node(Node *p) const noexceptGraphCommon< GT, Node, Arc >inline
reset_node_counters() const noexceptGraphCommon< GT, Node, Arc >inline
reset_nodes() constGraphCommon< GT, Node, Arc >inline
search_arc(Op &op) constGraphCommon< GT, Node, Arc >inline
search_arc(Op &&op) constGraphCommon< GT, Node, Arc >inline
search_arc(Node *p, Operation &op) constGraphCommon< GT, Node, Arc >inline
search_arc(Node *p, Operation &&op=Operation()) constGraphCommon< GT, Node, Arc >inline
search_arc(Node *src, Node *tgt) const noexceptGraphCommon< GT, Node, Arc >inline
search_directed_arc(Node *src, Node *tgt) const noexceptGraphCommon< GT, Node, Arc >inline
search_in_arc(Node *p, Op &op) constGraphCommon< GT, Node, Arc >inline
search_in_arc(Node *p, Op &&op=Op()) constGraphCommon< GT, Node, Arc >inline
search_node(const Point &)Aleph::Euclidian_Graph< __Euclidian_Node, __Euclidian_Arc >
List_Graph< __Euclidian_Node, __Euclidian_Arc >::search_node(Op &op) constGraphCommon< GT, Node, Arc >inline
List_Graph< __Euclidian_Node, __Euclidian_Arc >::search_node(Op &&op) constGraphCommon< GT, Node, Arc >inline
search_out_arc(Node *p, Op &op) constGraphCommon< GT, Node, Arc >inline
search_out_arc(Node *p, Op &&op=Op()) constGraphCommon< GT, Node, Arc >inline
set_bit(Node *node, int bit, int value) const noexceptGraphCommon< GT, Node, Arc >inline
set_bit(Arc *arc, int bit, int value) const noexceptGraphCommon< GT, Node, Arc >inline
set_digraph(bool val)GraphCommon< GT, Node, Arc >inline
sort_arcs(Compare &cmp) noexceptGraphCommon< GT, Node, Arc >inline
sort_arcs(Compare &&cmp=Compare()) noexceptGraphCommon< GT, Node, Arc >inline
sort_nodes(Compare &cmp) noexceptGraphCommon< GT, Node, Arc >inline
sort_nodes(Compare &&cmp=Compare()) noexceptGraphCommon< GT, Node, Arc >inline
sum_arcs(Node *p, Extract extract) constGraphCommon< GT, Node, Arc >inline
sum_arcs(Node *p) constGraphCommon< GT, Node, Arc >inline
swap(List_Graph &g) noexceptAleph::List_Graph< __Euclidian_Node, __Euclidian_Arc >inline
traverse_arcs(Operation &op) constGraphCommon< GT, Node, Arc >inline
traverse_arcs(Operation &&op=Operation()) constGraphCommon< GT, Node, Arc >inline
traverse_arcs(Node *p, Operation &op) constGraphCommon< GT, Node, Arc >inline
traverse_arcs(Node *p, Operation &&op=Operation()) constGraphCommon< GT, Node, Arc >inline
traverse_arcs(Node *p, Operation &op) constGraphCommon< GT, Node, Arc >inline
traverse_in_arcs(Node *p, Op &op) constGraphCommon< GT, Node, Arc >inline
traverse_in_arcs(Node *p, Op &&op=Op()) constGraphCommon< GT, Node, Arc >inline
traverse_nodes(Operation &op) constGraphCommon< GT, Node, Arc >inline
traverse_nodes(Operation &&op=Operation()) constGraphCommon< GT, Node, Arc >inline
traverse_out_arcs(Node *p, Op &op) constGraphCommon< GT, Node, Arc >inline
traverse_out_arcs(Node *p, Op &&op=Op()) constGraphCommon< GT, Node, Arc >inline
void_to_arc(Arc_Node *arc_node) noexceptAleph::List_Graph< __Euclidian_Node, __Euclidian_Arc >inlineprivatestatic
vsize() const noexceptGraphCommon< GT, Node, Arc >inline
~Euclidian_Graph()Aleph::Euclidian_Graph< __Euclidian_Node, __Euclidian_Arc >inlinevirtual
~List_Graph()Aleph::List_Graph< __Euclidian_Node, __Euclidian_Arc >inlinevirtual