gum::GUM_UndiGraphable Concept Reference

Concept for undirected graphs (edges with neighbours). More...

#include <graphConcepts.h>

Concept definition

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

Detailed Description

Concept for undirected graphs (edges with neighbours).

Satisfied by UndiGraph, CliqeGraph, and the undirected component of MixedGraph / PDAG. Refines GUM_NodeGraphable.

Definition at line 100 of file graphConcepts.h.