#include <Graph.hpp>
◆ neighborhood_t
◆ edge_t
typedef neighborhood_t::edge_t edge_t |
◆ node_t
typedef neighborhood_t::node_t node_t |
◆ Graph()
◆ 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()
◆ print_name_labels()
void print_name_labels |
( |
std::ostream & |
os | ) |
const |
◆ node_names
std::function<std::string(node_t)> node_names |
The documentation for this class was generated from the following file: