Mackey  V3.1
A C++ library for computing RO(G) graded homology
Graph< _neighborhood > Class Template Reference

#include <Graph.hpp>

Inheritance diagram for Graph< _neighborhood >:
[legend]

Public Types

typedef _neighborhood neighborhood_t
 
typedef neighborhood_t::edge_t edge_t
 
typedef neighborhood_t::node_t node_t
 

Public Member Functions

 Graph ()=default
 
size_t number_of_nodes () const
 
template<typename ... Args>
void draw_edge (node_t start, node_t end, Args &&... args)
 
void reserve_edges_for_node (size_t num, node_t node)
 
template<typename T >
void reserve_edges_per_node (const T &v)
 
void reserve_nodes (size_t n)
 
void adjoin_nodes (size_t new_number_of_nodes)
 
auto neighbors (node_t node) const -> const neighborhood_t &
 
void print_name_labels (std::ostream &os) const
 

Public Attributes

std::function< std::string(node_t)> node_names
 

Member Typedef Documentation

◆ neighborhood_t

typedef _neighborhood neighborhood_t

◆ edge_t

typedef neighborhood_t::edge_t edge_t

◆ node_t

typedef neighborhood_t::node_t node_t

Constructor & Destructor Documentation

◆ Graph()

Graph ( )
default

Member Function Documentation

◆ number_of_nodes()

size_t number_of_nodes ( ) const

◆ draw_edge()

void draw_edge ( node_t  start,
node_t  end,
Args &&...  args 
)

◆ reserve_edges_for_node()

void reserve_edges_for_node ( size_t  num,
node_t  node 
)

◆ reserve_edges_per_node()

void reserve_edges_per_node ( const T &  v)

◆ reserve_nodes()

void reserve_nodes ( size_t  n)

◆ adjoin_nodes()

void adjoin_nodes ( size_t  new_number_of_nodes)

◆ neighbors()

auto neighbors ( node_t  node) const -> const neighborhood_t &

◆ print_name_labels()

void print_name_labels ( std::ostream &  os) const

Member Data Documentation

◆ node_names

std::function<std::string(node_t)> node_names

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