| 22 | } |
| 23 | |
| 24 | void construct_mapping::construct_initial_mapping( PartitionConfig & config, graph_access & C, matrix & D, std::vector< NodeID > & perm_rank) { |
| 25 | switch( config.construction_algorithm ) { |
| 26 | case MAP_CONST_IDENTITY: |
| 27 | PRINT(std::cout << "running identity mapping" << std::endl;) |
| 28 | construct_identity( config, C, D, perm_rank); |
| 29 | break; |
| 30 | case MAP_CONST_RANDOM: |
| 31 | PRINT(std::cout << "running random initial mapping" << std::endl;) |
| 32 | construct_random( config, C, D, perm_rank); |
| 33 | break; |
| 34 | case MAP_CONST_OLDGROWING: |
| 35 | PRINT(std::cout << "running old growing" << std::endl;) |
| 36 | construct_old_growing( config, C, D, perm_rank); |
| 37 | break; |
| 38 | case MAP_CONST_OLDGROWING_FASTER: |
| 39 | PRINT(std::cout << "running faster growing" << std::endl;) |
| 40 | construct_old_growing_faster( config, C, D, perm_rank); |
| 41 | break; |
| 42 | case MAP_CONST_FASTHIERARCHY_BOTTOMUP: |
| 43 | PRINT(std::cout << "running fast hierarchy bottom up" << std::endl;) |
| 44 | construct_fast_hierarchy_bottomup( config, C, D, perm_rank); |
| 45 | break; |
| 46 | case MAP_CONST_FASTHIERARCHY_TOPDOWN: |
| 47 | PRINT(std::cout << "running fast hierarchy top down" << std::endl;) |
| 48 | construct_fast_hierarchy_topdown( config, C, D, perm_rank); |
| 49 | break; |
| 50 | default: |
| 51 | PRINT(std::cout << "running identity mapping" << std::endl;) |
| 52 | construct_identity( config, C, D, perm_rank); |
| 53 | } |
| 54 | } |
| 55 | |
| 56 | void construct_mapping::construct_old_growing_matrix( PartitionConfig & config, matrix & C, matrix & D, std::vector< NodeID > & perm_rank) { |
| 57 | std::cout << "constructing initial mapping matrix version of growing" << std::endl; |