From 0ee8ea0efccb6799f10ae8548366e9ffee76f483 Mon Sep 17 00:00:00 2001 From: linlin Date: Thu, 15 Oct 2020 16:36:46 +0200 Subject: [PATCH] New translations shortest_path.py (French) --- lang/fr/gklearn/kernels/shortest_path.py | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) diff --git a/lang/fr/gklearn/kernels/shortest_path.py b/lang/fr/gklearn/kernels/shortest_path.py index 1923b00..b068e6e 100644 --- a/lang/fr/gklearn/kernels/shortest_path.py +++ b/lang/fr/gklearn/kernels/shortest_path.py @@ -47,7 +47,7 @@ class ShortestPath(GraphKernel): from itertools import combinations_with_replacement itr = combinations_with_replacement(range(0, len(self._graphs)), 2) if self._verbose >= 2: - iterator = tqdm(itr, desc='calculating kernels', file=sys.stdout) + iterator = tqdm(itr, desc='Computing kernels', file=sys.stdout) else: iterator = itr for i, j in iterator: @@ -102,7 +102,7 @@ class ShortestPath(GraphKernel): # compute kernel list. kernel_list = [None] * len(g_list) if self._verbose >= 2: - iterator = tqdm(range(len(g_list)), desc='calculating kernels', file=sys.stdout) + iterator = tqdm(range(len(g_list)), desc='Computing kernels', file=sys.stdout) else: iterator = range(len(g_list)) for i in iterator: @@ -145,7 +145,7 @@ class ShortestPath(GraphKernel): itr = range(len(g_list)) len_itr = len(g_list) parallel_me(do_fun, func_assign, kernel_list, itr, len_itr=len_itr, - init_worker=init_worker, glbv=(g1, g_list), method='imap_unordered', n_jobs=self._n_jobs, itr_desc='calculating kernels', verbose=self._verbose) + init_worker=init_worker, glbv=(g1, g_list), method='imap_unordered', n_jobs=self._n_jobs, itr_desc='Computing kernels', verbose=self._verbose) return kernel_list