@@ -17,9 +17,9 @@ using namespace it_lab_ai;
1717
1818void print_split_dist (const Graph& graph) {
1919 auto split_dist = graph.getSplitDistribution ();
20- for (int i = 0 ; i < split_dist.size (); i++) {
20+ for (size_t i = 0 ; i < split_dist.size (); i++) {
2121 std::cout << " Split #" << i + 1 << " : " ;
22- for (int j = 0 ; j < split_dist[i].size (); j++) {
22+ for (size_t j = 0 ; j < split_dist[i].size (); j++) {
2323 std::cout << " (" << split_dist[i][j].first << " , "
2424 << split_dist[i][j].second << " ) " ;
2525 }
@@ -321,11 +321,8 @@ void alexnet_comparison(int type = 3, int whoonly = 3) {
321321 }
322322}
323323
324- int main (int argc, char * argv[] ) {
324+ int main () {
325325 // int type = (argc > 1) ? (int)(argv[1][0]-'0') : 0;
326- if (argc > 1 ) {
327- argv;
328- }
329326 int type = 1 ;
330327 int type2 = 2 ;
331328 int whoonly = 3 ;
@@ -409,7 +406,7 @@ int main(int argc, char* argv[]) {
409406 auto time2 = elapsed_time_avg<double , std::milli>(10 , find_subgraphs,
410407 graph1, subgraph2);
411408
412- for (int i = 0 ; i < vec.size (); i++) {
409+ for (size_t i = 0 ; i < vec.size (); i++) {
413410 std::cout << i + 1 << " ) " ;
414411 for (int j : vec[i]) {
415412 std::cout << j << ' ' ;
@@ -418,7 +415,7 @@ int main(int argc, char* argv[]) {
418415 }
419416 std::cout << " Time for DenseNet BN -> ReLU -> Conv -> ReLU -> Conv: " << time << ' \n ' ;
420417
421- for (int i = 0 ; i < vec2.size (); i++) {
418+ for (size_t i = 0 ; i < vec2.size (); i++) {
422419 std::cout << i + 1 << " ) " ;
423420 for (int j : vec2[i]) {
424421 std::cout << j << ' ' ;
@@ -446,7 +443,7 @@ int main(int argc, char* argv[]) {
446443
447444 auto time = elapsed_time_avg<double , std::milli>(10 , find_subgraphs,
448445 graph1, subgraph);
449- for (int i = 0 ; i < vec.size (); i++) {
446+ for (size_t i = 0 ; i < vec.size (); i++) {
450447 std::cout << i + 1 << " ) " ;
451448 for (int j : vec[i]) {
452449 std::cout << j << ' ' ;
@@ -481,7 +478,7 @@ int main(int argc, char* argv[]) {
481478
482479 auto time = elapsed_time_avg<double , std::milli>(10 , find_subgraphs,
483480 graph1, subgraph);
484- for (int i = 0 ; i < vec.size (); i++) {
481+ for (size_t i = 0 ; i < vec.size (); i++) {
485482 std::cout << i + 1 << " ) " ;
486483 for (int j : vec[i]) {
487484 std::cout << j << ' ' ;
@@ -517,7 +514,7 @@ int main(int argc, char* argv[]) {
517514
518515 auto time = elapsed_time_avg<double , std::milli>(10 , find_subgraphs,
519516 graph1, subgraph);
520- for (int i = 0 ; i < vec1.size (); i++) {
517+ for (size_t i = 0 ; i < vec1.size (); i++) {
521518 std::cout << i + 1 << " ) " ;
522519 for (int j : vec1[i]) {
523520 std::cout << j << ' ' ;
@@ -544,7 +541,7 @@ int main(int argc, char* argv[]) {
544541
545542 auto time = elapsed_time_avg<double , std::milli>(10 , find_subgraphs,
546543 graph1, subgraph);
547- for (int i = 0 ; i < vec.size (); i++) {
544+ for (size_t i = 0 ; i < vec.size (); i++) {
548545 std::cout << i + 1 << " ) " ;
549546 for (int j : vec[i]) {
550547 std::cout << j << ' ' ;
0 commit comments