Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
Loading...
Searching...
No Matches
Aleph::Random_Graph< GT, Init_Node, Init_Arc > Member List

This is the complete list of members for Aleph::Random_Graph< GT, Init_Node, Init_Arc >, including all inherited members.

balance_graph_nodes_degree(GT_Node *src, GT_Node *tgt)Aleph::Random_Graph< GT, Init_Node, Init_Arc >inlineprivate
connect() overrideAleph::Random_Graph< GT, Init_Node, Init_Arc >inlineprivatevirtual
create(const size_t &__num_nodes, const size_t &__num_arcs, const bool connected)Aleph::Random_Graph_Base< GT, Init_Node, Init_Arc >inlineprotected
create_nodes_and_initialize_arc_index() overrideAleph::Random_Graph< GT, Init_Node, Init_Arc >inlineprivatevirtual
create_p(const size_t &__num_nodes, const double &p, const bool connected) overrideAleph::Random_Graph< GT, Init_Node, Init_Arc >inlineprivatevirtual
eulerian(const size_t &__num_nodes, const size_t &__num_arcs)Aleph::Random_Graph< GT, Init_Node, Init_Arc >inline
eulerian(const size_t &__num_nodes, const double &p)Aleph::Random_Graph< GT, Init_Node, Init_Arc >inline
even_nodesAleph::Random_Graph< GT, Init_Node, Init_Arc >private
gAleph::Random_Graph_Base< GT, Init_Node, Init_Arc >protected
GT_Arc typedefAleph::Random_Graph< GT, Init_Node, Init_Arc >private
GT_Node typedefAleph::Random_Graph< GT, Init_Node, Init_Arc >private
idx_arcAleph::Random_Graph_Base< GT, Init_Node, Init_Arc >protected
init_arcAleph::Random_Graph_Base< GT, Init_Node, Init_Arc >protected
init_nodeAleph::Random_Graph_Base< GT, Init_Node, Init_Arc >protected
initialize_and_create_nodes(const size_t &__num_nodes, const size_t &__num_arcs)Aleph::Random_Graph_Base< GT, Init_Node, Init_Arc >inlineprotected
insert_arc(GT_Node *src, GT_Node *tgt)Aleph::Random_Graph_Base< GT, Init_Node, Init_Arc >inlineprotected
make_eulerian() overrideAleph::Random_Graph< GT, Init_Node, Init_Arc >inlineprivatevirtual
make_hamiltonian() overrideAleph::Random_Graph< GT, Init_Node, Init_Arc >inlineprivatevirtual
nodesAleph::Random_Graph_Base< GT, Init_Node, Init_Arc >protected
num_arcsAleph::Random_Graph_Base< GT, Init_Node, Init_Arc >mutableprotected
num_nodesAleph::Random_Graph_Base< GT, Init_Node, Init_Arc >mutableprotected
odd_nodesAleph::Random_Graph< GT, Init_Node, Init_Arc >private
operator()(const size_t &__num_nodes, const size_t &__num_arcs, bool connected=true)Aleph::Random_Graph< GT, Init_Node, Init_Arc >inline
operator()(const size_t &__num_nodes, const double &p, bool connected=true)Aleph::Random_Graph< GT, Init_Node, Init_Arc >inline
rAleph::Random_Graph_Base< GT, Init_Node, Init_Arc >protected
rand_maxAleph::Random_Graph_Base< GT, Init_Node, Init_Arc >mutableprotected
Random_Graph(unsigned long seed, const Init_Node &__init_node, const Init_Arc &__init_arc)Aleph::Random_Graph< GT, Init_Node, Init_Arc >inline
Random_Graph(unsigned long seed=time(nullptr), const Init_Node &&__init_node=Init_Node(), const Init_Arc &&__init_arc=Init_Arc())Aleph::Random_Graph< GT, Init_Node, Init_Arc >inline
Random_Graph_Base(const unsigned long seed, const Init_Node &__init_node, const Init_Arc &__init_arc)Aleph::Random_Graph_Base< GT, Init_Node, Init_Arc >inlineprotected
save_parityAleph::Random_Graph_Base< GT, Init_Node, Init_Arc >protected
select_random_node(GT_Node *excluded=nullptr) noexceptAleph::Random_Graph_Base< GT, Init_Node, Init_Arc >inlineprotected
select_random_node(DynList< GT_Node * > &list) noexceptAleph::Random_Graph_Base< GT, Init_Node, Init_Arc >inlineprotected
sufficient_hamiltonian(const size_t &__num_nodes, const double &p=0.5)Aleph::Random_Graph< GT, Init_Node, Init_Arc >inline
update_parity_after_arc_insertion(GT_Node *src, GT_Node *tgt)Aleph::Random_Graph< GT, Init_Node, Init_Arc >inlineprivatevirtual
~Random_Graph_Base()Aleph::Random_Graph_Base< GT, Init_Node, Init_Arc >inlineprotectedvirtual