#include <planar_graph.hxx>
Definition at line 81 of file planar_graph.hxx.
§ PlanarGraph() [1/2]
| opengm::external::planargraph::PlanarGraph::PlanarGraph |
( |
| ) |
|
§ PlanarGraph() [2/2]
| opengm::external::planargraph::PlanarGraph::PlanarGraph |
( |
size_t |
n, |
|
|
bool |
debug = false |
|
) |
| |
§ ~PlanarGraph()
| opengm::external::planargraph::PlanarGraph::~PlanarGraph |
( |
| ) |
|
§ add_edge()
§ add_edge_weight()
| void opengm::external::planargraph::PlanarGraph::add_edge_weight |
( |
size_t |
e, |
|
|
DataType |
w |
|
) |
| |
§ add_node()
| size_t opengm::external::planargraph::PlanarGraph::add_node |
( |
| ) |
|
§ calculate_maxcut()
| void opengm::external::planargraph::PlanarGraph::calculate_maxcut |
( |
| ) |
|
§ clear_faces()
| void opengm::external::planargraph::PlanarGraph::clear_faces |
( |
| ) |
|
|
protected |
§ compute_dual_num_edges()
| size_t opengm::external::planargraph::PlanarGraph::compute_dual_num_edges |
( |
| ) |
const |
|
protected |
§ construct_dual()
| void opengm::external::planargraph::PlanarGraph::construct_dual |
( |
| ) |
|
§ cost_of_cut() [1/2]
| double opengm::external::planargraph::PlanarGraph::cost_of_cut |
( |
const std::vector< int > & |
x | ) |
const |
§ cost_of_cut() [2/2]
| double opengm::external::planargraph::PlanarGraph::cost_of_cut |
( |
| ) |
const |
§ find_edge()
| long int opengm::external::planargraph::PlanarGraph::find_edge |
( |
size_t |
u, |
|
|
size_t |
v |
|
) |
| const |
§ get_cut()
| std::vector< bool > opengm::external::planargraph::PlanarGraph::get_cut |
( |
| ) |
const |
§ get_dest()
| long int opengm::external::planargraph::PlanarGraph::get_dest |
( |
size_t |
v, |
|
|
size_t |
e |
|
) |
| const |
|
protected |
§ get_following_edge()
| long int opengm::external::planargraph::PlanarGraph::get_following_edge |
( |
size_t |
v, |
|
|
size_t |
e |
|
) |
| const |
|
protected |
§ get_labeling()
| void opengm::external::planargraph::PlanarGraph::get_labeling |
( |
std::vector< int > & |
x | ) |
const |
§ get_labeling_from_cut()
| std::vector< int > opengm::external::planargraph::PlanarGraph::get_labeling_from_cut |
( |
const std::vector< bool > & |
cut | ) |
const |
§ num_edges()
| size_t opengm::external::planargraph::PlanarGraph::num_edges |
( |
| ) |
const |
|
inline |
§ num_faces()
| size_t opengm::external::planargraph::PlanarGraph::num_faces |
( |
| ) |
const |
|
inline |
§ num_nodes()
| size_t opengm::external::planargraph::PlanarGraph::num_nodes |
( |
| ) |
const |
|
inline |
§ planarize()
| void opengm::external::planargraph::PlanarGraph::planarize |
( |
| ) |
|
§ print()
| void opengm::external::planargraph::PlanarGraph::print |
( |
| ) |
|
§ debug_
| bool opengm::external::planargraph::PlanarGraph::debug_ |
|
protected |
§ Dual_
| PerfectMatching* opengm::external::planargraph::PlanarGraph::Dual_ |
|
protected |
§ edges
| std::vector<Edge> opengm::external::planargraph::PlanarGraph::edges |
|
protected |
§ faces
| std::vector<Face> opengm::external::planargraph::PlanarGraph::faces |
|
protected |
§ nodes_
| std::vector<Node> opengm::external::planargraph::PlanarGraph::nodes_ |
|
protected |
Collaboration diagram for opengm::external::planargraph::PlanarGraph:
