From da1d755f4acd39c290815a814d49ec93cf3e2b45 Mon Sep 17 00:00:00 2001 From: Unick Soft Date: Mon, 20 Jul 2020 21:20:46 +0200 Subject: [PATCH] Added translation algorithm names to French --- lang/fr/home.php | 32 ++++++++++++++++---------------- tpl/home.php | 6 +++--- 2 files changed, 19 insertions(+), 19 deletions(-) diff --git a/lang/fr/home.php b/lang/fr/home.php index 326d389..592b7a8 100644 --- a/lang/fr/home.php +++ b/lang/fr/home.php @@ -151,20 +151,20 @@ $g_lang["copy_select_group"] = "Groupe de copie"; $g_lang["remove_select_group"] = "Supprimer le groupe"; - $g_lang["bfs_name"] = "Breadth-first search"; - $g_lang["coloring_name"] = "Graph coloring"; - $g_lang["find_connection_component_name"] = "Find connected components"; - $g_lang["dfs_name"] = "Depth-first search"; - $g_lang["eulerin_loop_name"] = "Find Eulerian cycle"; - $g_lang["eulerin_path_name"] = "Find Eulerian path"; - $g_lang["fiold_name"] = "Floyd–Warshall algorithm"; - $g_lang["graph_reorder_name"] = "Arrange the graph"; - $g_lang["hamiltoian_cycle_name"] = "Find Hamiltonian cycle"; - $g_lang["hamiltonian_path_name"] = "Find Hamiltonian path"; - $g_lang["max_flow_name"] = "Find Maximum flow"; - $g_lang["minimum_spanning_tree"] = "Search of minimum spanning tree"; - $g_lang["modern_graph_style_name"] = "Visualisation based on weight"; - $g_lang["radius_and_diameter_name"] = "Search graph radius and diameter"; - $g_lang["find_short_path_name"] = "Find shortest path using Dijkstra's algorithm"; - $g_lang["vertices_degree_name"] = "Calculate vertexes degree"; + $g_lang["bfs_name"] = "Parcours en largeur"; + $g_lang["coloring_name"] = "Coloriage du graphe"; + $g_lang["find_connection_component_name"] = "Recherche de composantes connexes"; + $g_lang["dfs_name"] = "Parcours en profondeur"; + $g_lang["eulerin_loop_name"] = "Chercher un cycle eulérien"; + $g_lang["eulerin_path_name"] = "Chercher un chemin eulérien"; + $g_lang["fiold_name"] = "Algorithme de Floyd-Warshall"; + $g_lang["graph_reorder_name"] = "Arrangement du graphe"; + $g_lang["hamiltoian_cycle_name"] = "Trouver un cycle Hamiltonien"; + $g_lang["hamiltonian_path_name"] = "Trouver un chemin Hamiltonien"; + $g_lang["max_flow_name"] = "Recherche du flot maximal"; + $g_lang["minimum_spanning_tree"] = "Arbre couvrant de poids minimal"; + $g_lang["modern_graph_style_name"] = "Visualisation pondérée"; + $g_lang["radius_and_diameter_name"] = "Calcul du rayon et du diamètre du graphe"; + $g_lang["find_short_path_name"] = "Plus court chemin avec l'algorithme de Dijkstra"; + $g_lang["vertices_degree_name"] = "Calculer le degré des sommets"; ?> \ No newline at end of file diff --git a/tpl/home.php b/tpl/home.php index 98051f5..a3973b4 100755 --- a/tpl/home.php +++ b/tpl/home.php @@ -164,13 +164,13 @@ - +
- +
- You may help with translation algorithm names to French + You may help with translation algorithm names to Spanish