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

Method map_problem

dlib/test/find_max_factor_graph_viterbi.cpp:38–43  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

36 unsigned long num_states() const { return NS; }
37
38 map_problem()
39 {
40 data = randm(number_of_nodes(),(long)std::pow(num_states(),(double)order()+1), rnd);
41 if (all_negative)
42 data = -data;
43 }
44
45 unsigned long number_of_nodes (
46 ) const

Callers

nothing calls this directly

Calls 1

randmFunction · 0.70

Tested by

no test coverage detected