| 240 | |
| 241 | template<class T> |
| 242 | std::vector<std::pair<int, T>> quickSort(const std::vector<T>& vec) |
| 243 | { |
| 244 | std::vector<std::pair<int, T>> sort_vec; |
| 245 | for (int i = 0; i < vec.size(); i++) |
| 246 | { |
| 247 | sort_vec.push_back(std::make_pair(i, vec[i])); |
| 248 | } |
| 249 | |
| 250 | std::sort(sort_vec.begin(), sort_vec.end(), lessCmp<T>); |
| 251 | |
| 252 | return sort_vec; |
| 253 | } |
| 254 | |
| 255 | int calcNodeSort( |
| 256 | const vector<vector<double>>& graph, |