MCPcopy Create free account
hub / github.com/davisking/dlib / setup

Method setup

dlib/graph_cuts/find_max_factor_graph_potts.h:38–47  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

36 public:
37
38 void setup(
39 const potts_problem& p
40 )
41 {
42 flows.resize(p.number_of_nodes());
43 for (unsigned long i = 0; i < flows.size(); ++i)
44 {
45 flows[i].resize(p.number_of_neighbors(i));
46 }
47 }
48
49 edge_type& operator() (
50 const long r,

Callers 1

potts_flow_graphMethod · 0.45

Calls 4

resizeMethod · 0.45
number_of_nodesMethod · 0.45
sizeMethod · 0.45
number_of_neighborsMethod · 0.45

Tested by

no test coverage detected