#include <min_cut_graph.hpp>
◆ add_node()
void vg::algorithms::Graph::add_node |
( |
size_t |
id, |
|
|
Node |
node |
|
) |
| |
|
inline |
◆ get_node_by_id()
Node& vg::algorithms::Graph::get_node_by_id |
( |
size_t |
node_id | ) |
|
|
inline |
◆ get_node_ids()
vector<size_t> vg::algorithms::Graph::get_node_ids |
( |
| ) |
|
|
inline |
◆ get_size()
size_t vg::algorithms::Graph::get_size |
( |
| ) |
|
|
inline |
◆ get_weight_using_other()
size_t vg::algorithms::Graph::get_weight_using_other |
( |
Node |
prev_node, |
|
|
size_t |
other |
|
) |
| |
|
inline |
◆ nodes
unordered_map<size_t,Node> vg::algorithms::Graph::nodes |
|
private |
The documentation for this struct was generated from the following file: