d4/de5/conceptAleph_1_1graph__concepts__detail_1_1AlephGraphImpl.html

template<class G>

concept Aleph::graph_concepts_detail::AlephGraphImpl =

        requires

          {

            typename G::Node;

            typename G::Arc;

            typename G::Node_Type;

            typename G::Arc_Type;

          } and

        requires(const G & g, typename G::Arc * a)

          {

            { g.get_num_nodes() } -> std::convertible_to<std::size_t>;

            { g.get_num_arcs() } -> std::convertible_to<std::size_t>;

            { g.get_src_node(a) } -> std::convertible_to<typename G::Node *>;

            { g.get_tgt_node(a) } -> std::convertible_to<typename G::Node *>;

            { g.is_digraph() } -> std::convertible_to<bool>;

          }

Aleph::List_Graph
Graph implemented with double-linked adjacency lists.
Definition tpl_graph.H:429

Aleph::List_Graph::Node_Type
typename Node::Node_Type Node_Type
The arc class type.
Definition tpl_graph.H:437

Aleph::List_Graph::Node
_Graph_Node Node
The graph type.
Definition tpl_graph.H:433

Aleph::List_Graph::Arc
_Graph_Arc Arc
The node class type.
Definition tpl_graph.H:434

Aleph::List_Graph::Arc_Type
typename Arc::Arc_Type Arc_Type
The type of data stored in the arc.
Definition tpl_graph.H:440

Aleph::graph_concepts_detail::AlephGraphImpl
Unqualified form of AlephGraph, applied to a cv/ref-free type.
Definition ah-graph-concepts.H:76

Aleph::and
and
Check uniqueness with explicit hash + equality functors.
Definition ahFunctional.H:2648