GraphTraits.hpp

Go to the documentation of this file.

 
//                Copyright Oliver J. Rosten 2020.                //
// Distributed under the GNU GENERAL PUBLIC LICENSE, Version 3.0. //
//    (See accompanying file LICENSE.md or copy at                //
//          https://www.gnu.org/licenses/gpl-3.0.en.html)         //
 
#pragma once
 
namespace sequoia::maths
{
  template<class N>
  concept network = requires(const N& n) {
    typename N::edge_type;
    typename N::edge_weight_type;
    typename N::edge_index_type;
    typename N::edge_init_type;
    typename N::size_type;
    typename N::const_edge_iterator;
    typename N::const_reverse_edge_iterator;
 
    { n.size() }          -> std::same_as<typename N::size_type>;
    { n.order() }         -> std::same_as<typename N::size_type>;
    { n.cbegin_edges(0) } -> std::same_as<typename N::const_edge_iterator>;
    { n.cend_edges(0) }   -> std::same_as<typename N::const_edge_iterator>;
  };
 
  template<class G>
  inline constexpr bool dynamic_nodes{
       requires(std::remove_const_t<G>& g) { g.erase_node(0); }
    || requires(std::remove_const_t<G>& g) { g.prune(0); }
  };
 
  template<class G>
  inline constexpr bool heterogeneous_nodes{
    requires { typename G::heterogeneous_nodes_type; }
  };
 
  template<class G>
  inline constexpr bool static_nodes{!dynamic_nodes<G>};
 
  template<class G>
  concept dynamic_network = network<G> && dynamic_nodes<G>;
 
  template<class G>
  concept static_network = network<G> && static_nodes<G>;
 
  template<class G>
  concept heterogeneous_network = network<G> && heterogeneous_nodes<G>;
 
  template<class T>
  concept dynamic_tree = dynamic_network<T> && requires {
    T::link_dir;
  };
 
}