tidy: while ( true ) instead of while ( 1 )

alib2graph_algo/src/shortest_path/IDAStar.hpp

@@ -115,7 +115,7 @@ IDAStar::findPath(const TGraph &graph,
   data.path_set.insert(start);
   weight_type bound = f_heuristic(start);
-  while (1) {
+  while ( true ) {
     bool found;
     weight_type t;
     ext::tie(found, t) = search(graph, data, goal, 0, bound, f_heuristic, f_user);