graaf
Loading...
Searching...
No Matches
graaf Namespace Referenceexport

Classes

class  weighted_edge
class  graph
class  tree
 A generic tree structure. More...
struct  edge_id_hash

Concepts

concept  derived_from_weighted_edge

Typedefs

template<typename VERTEX_T, typename EDGE_T>
using directed_graph = graph<VERTEX_T, EDGE_T, graph_type::DIRECTED>
template<typename VERTEX_T, typename EDGE_T>
using undirected_graph = graph<VERTEX_T, EDGE_T, graph_type::UNDIRECTED>
using vertex_id_t = std::size_t
using edge_id_t = std::pair<vertex_id_t, vertex_id_t>

Enumerations

enum class  graph_type { DIRECTED , UNDIRECTED }

Functions

template<typename WEIGHTED_EDGE_T>
auto get_weight (const WEIGHTED_EDGE_T &edge)
template<typename EDGE_T>
EDGE_T get_weight (const EDGE_T &edge)
template<typename EDGE_T>
int get_weight (const EDGE_T &)
template<class T>
void hash_combine (std::size_t &seed, const T &v)

Detailed Description

Based on boost::hash_combine. Since Boost is licensed under the Boost Software License, we include a copy of the license here.

  • Boost Software License - Version 1.0 - August 17th, 2003 ... (License text omitted for brevity in code block, but preserved in your source)

Function Documentation

◆ hash_combine()

template<class T>
void graaf::hash_combine ( std::size_t & seed,
const T & v )
export

Utility for combining hashes. Note: While this is used internally for edge_id_hash, we export it as it's a useful general utility for graph types.