gum::GUM_DiGraphable Concept Reference

Concept for directed graphs (arcs with parents/children). More...

#include <graphConcepts.h>

Concept definition

  template< typename T >
  concept GUM_DiGraphable = GUM_NodeGraphable< T > && requires(const T g, NodeId u, NodeId v) {
    { g.existsArc(u, v) } -> std::convertible_to< bool >;
    { g.parents(u) } -> std::convertible_to< const NodeSet& >;
    { g.children(u) } -> std::convertible_to< const NodeSet& >;
  }

Detailed Description

Concept for directed graphs (arcs with parents/children).

Satisfied by DiGraph, DAG, and the directed component of MixedGraph / PDAG. Refines GUM_NodeGraphable.

Definition at line 87 of file graphConcepts.h.