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

Method map_problem

dlib/test/find_max_factor_graph_nmplp.cpp:36–48  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

34
35 mutable std::map<unordered_pair<int>,std::map<std::pair<int,int>,double> > weights;
36 map_problem()
37 {
38 for (int i = 0; i < 8; ++i)
39 {
40 for (int j = i; j < 8; ++j)
41 {
42 weights[make_unordered_pair(i,j)][make_pair(0,0)] = rnd.get_random_gaussian();
43 weights[make_unordered_pair(i,j)][make_pair(0,1)] = rnd.get_random_gaussian();
44 weights[make_unordered_pair(i,j)][make_pair(1,0)] = rnd.get_random_gaussian();
45 weights[make_unordered_pair(i,j)][make_pair(1,1)] = rnd.get_random_gaussian();
46 }
47 }
48 }
49
50 struct node_iterator
51 {

Callers

nothing calls this directly

Calls 2

make_unordered_pairFunction · 0.85
get_random_gaussianMethod · 0.80

Tested by

no test coverage detected