|
graaf
|
Concepts | |
| concept | graaf::derived_from_weighted_edge |
Classes | |
| struct | graaf::edge_id_hash |
| class | graaf::tree< VERTEX_T, EDGE_T > |
| A generic tree structure. More... | |
| class | graaf::graph< VERTEX_T, EDGE_T, GRAPH_TYPE_V > |
| class | graaf::weighted_edge< WEIGHT_T > |
Enumerations | |
| enum class | graph_type { DIRECTED , UNDIRECTED } |
Typedefs | |
| using | graaf::vertex_id_t = std::size_t |
| using | graaf::edge_id_t = std::pair<vertex_id_t, vertex_id_t> |
| template<typename VERTEX_T, typename EDGE_T> | |
| using | graaf::directed_graph = graph<VERTEX_T, EDGE_T, graph_type::DIRECTED> |
| template<typename VERTEX_T, typename EDGE_T> | |
| using | graaf::undirected_graph = graph<VERTEX_T, EDGE_T, graph_type::UNDIRECTED> |
Functions | |
| template<class T> | |
| void | graaf::hash_combine (std::size_t &seed, const T &v) |
| std::pair< vertex_id_t, vertex_id_t > | graaf::detail::make_sorted_pair (vertex_id_t vertex_id_lhs, vertex_id_t vertex_id_rhs) |
| template<typename WEIGHTED_EDGE_T> | |
| auto | graaf::get_weight (const WEIGHTED_EDGE_T &edge) |
| template<typename EDGE_T> | |
| EDGE_T | graaf::get_weight (const EDGE_T &edge) |
| template<typename EDGE_T> | |
| int | graaf::get_weight (const EDGE_T &) |