brigand::digraph< List< edges... > > Struct Template Reference

Public Types
using	edge_list = list<edges...>
using	unique_vertex_list
using	vertex_count = size<unique_vertex_list>
using	edge_count = uint32_t<sizeof...(edges)>
using	adjacency_list
using	ingoing_list

Static Public Member Functions
template<class E>
static digraph<::brigand::remove< list< edges... >, detail::get_edge_impl< digraph< List< edges... > >, typename E::source, typename E::destination > > >	erase (brigand::type_< E >)
template<class E>
static digraph< push_back< remove< list< edges... >, detail::get_edge_impl< digraph< List< edges... > >, typename E::source, typename E::destination > >, E > >	insert (::brigand::type_< E >)

Member Typedef Documentation

adjacency_list

template<template< class... > class List, class... edges>

using brigand::digraph< List< edges... > >::adjacency_list

Initial value:

 
      compute_adjacency_list<unique_vertex_list, has_source, edges...>

ingoing_list

template<template< class... > class List, class... edges>

using brigand::digraph< List< edges... > >::ingoing_list

Initial value:

 
      compute_adjacency_list<unique_vertex_list, has_destination, edges...>

unique_vertex_list

template<template< class... > class List, class... edges>

using brigand::digraph< List< edges... > >::unique_vertex_list

Initial value:

 
      fold<edge_list, list<>, add_unique_vertex<_state, _element>>

---

The documentation for this struct was generated from the following file:

• src/Utilities/TmplDigraph.hpp