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

Function make_data_sparse

dlib/test/graph_labeler.cpp:112–191  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

110 typename labels_type
111 >
112 void make_data_sparse(
113 samples_type& samples,
114 labels_type& labels
115 )
116 {
117 //samples.clear();
118 //labels.clear();
119
120 std::vector<bool> label;
121 graph_type g;
122 typename graph_type::edge_type v;
123
124 // ---------------------------
125 g.set_number_of_nodes(4);
126 label.resize(g.number_of_nodes());
127 g.node(0).data[2] = 1; label[0] = true;
128 g.node(1).data[2] = 1; label[1] = true;
129 g.node(2).data[1] = 1; label[2] = false;
130 g.node(3).data[1] = 1; label[3] = false;
131
132 g.add_edge(0,1);
133 g.add_edge(1,2);
134 g.add_edge(2,3);
135 g.add_edge(3,0);
136 g.add_edge(3,1);
137
138 v[0] = 1; v[1] = 1;
139 edge(g,0,1) = v;
140 edge(g,1,2) = v;
141 edge(g,2,3) = v;
142 edge(g,3,0) = v;
143 samples.push_back(g);
144 labels.push_back(label);
145 // ---------------------------
146
147 g.clear();
148 g.set_number_of_nodes(5);
149 label.resize(g.number_of_nodes());
150 g.node(0).data[2] = 1; label[0] = true;
151 g.node(1).data[0] = 0; label[1] = true;
152 g.node(2).data[1] = 1; label[2] = false;
153 g.node(3).data[0] = 0; label[3] = false;
154 label[4] = true;
155
156 g.add_edge(0,1);
157 g.add_edge(1,4);
158 g.add_edge(1,2);
159 g.add_edge(2,3);
160 g.add_edge(3,0);
161
162 edge(g,0,1)[0] = 1;
163 edge(g,1,4)[0] = 1;
164 edge(g,1,2)[1] = 1;
165 edge(g,2,3)[0] = 1;
166 edge(g,3,0)[1] = 1;
167 samples.push_back(g);
168 labels.push_back(label);
169 // ---------------------------

Callers

nothing calls this directly

Calls 4

resizeMethod · 0.45
number_of_nodesMethod · 0.45
push_backMethod · 0.45
clearMethod · 0.45

Tested by

no test coverage detected