#include <graph.h>
|
| | Graph (void(*err_function)(char *)=NULL) |
| |
| | ~Graph () |
| |
| node_id | add_node () |
| |
| void | add_edge (node_id from, node_id to, captype cap, captype rev_cap) |
| |
| void | set_tweights (node_id i, captype cap_source, captype cap_sink) |
| |
| void | add_tweights (node_id i, captype cap_source, captype cap_sink) |
| |
| termtype | what_segment (node_id i) |
| |
| flowtype | maxflow () |
| |
| void | set_active (node *i) |
| |
| node * | next_active () |
| |
| void | prepare_graph () |
| |
| void | maxflow_init () |
| |
| void | augment (node *s_start, node *t_start, captype *cap_middle, captype *rev_cap_middle) |
| |
| void | process_source_orphan (node *i) |
| |
| void | process_sink_orphan (node *i) |
| |
◆ arc_for_block
◆ arc_forward
◆ arc_rev_block
◆ arc_reverse
◆ captype
◆ flowtype
◆ node
◆ node_block
◆ node_id
◆ nodeptr
◆ termtype
◆ Graph()
| GraphCutFS::Graph::Graph |
( |
void(*)(char *) |
err_function = NULL | ) |
|
◆ ~Graph()
| GraphCutFS::Graph::~Graph |
( |
| ) |
|
◆ add_edge()
◆ add_node()
◆ add_tweights()
◆ augment()
| void GraphCutFS::Graph::augment |
( |
node * |
s_start, |
|
|
node * |
t_start, |
|
|
captype * |
cap_middle, |
|
|
captype * |
rev_cap_middle |
|
) |
| |
◆ maxflow()
◆ maxflow_init()
| void GraphCutFS::Graph::maxflow_init |
( |
| ) |
|
◆ next_active()
◆ prepare_graph()
| void GraphCutFS::Graph::prepare_graph |
( |
| ) |
|
◆ process_sink_orphan()
| void GraphCutFS::Graph::process_sink_orphan |
( |
node * |
i | ) |
|
◆ process_source_orphan()
| void GraphCutFS::Graph::process_source_orphan |
( |
node * |
i | ) |
|
◆ set_active()
| void GraphCutFS::Graph::set_active |
( |
node * |
i | ) |
|
|
inline |
◆ set_tweights()
◆ what_segment()
◆ arc_for_block_first
◆ arc_rev_block_first
◆ error_function
| void(* GraphCutFS::Graph::error_function) (char *) |
◆ flow
◆ node_block_first
◆ nodeptr_block
◆ orphan_first
| nodeptr* GraphCutFS::Graph::orphan_first |
◆ orphan_last
| nodeptr * GraphCutFS::Graph::orphan_last |
◆ queue_first
| node* GraphCutFS::Graph::queue_first[2] |
◆ queue_last
| node * GraphCutFS::Graph::queue_last[2] |
◆ TIME
| int GraphCutFS::Graph::TIME |
The documentation for this class was generated from the following files:
- M:/drive/Etri_Code/DOXYGEN/ETRI CODE/ETRI_3rd_Year_SurfelCut/Src/GraphCutFS/graph.h
- M:/drive/Etri_Code/DOXYGEN/ETRI CODE/ETRI_3rd_Year_SurfelCut/Src/GraphCutFS/graph.cpp
- M:/drive/Etri_Code/DOXYGEN/ETRI CODE/ETRI_3rd_Year_SurfelCut/Src/GraphCutFS/maxflow.cpp