<?php

    $g_lang["title_notg"] = "Trouver le plus court chemin";
    $g_lang["text"] = "<p>Créer un graphe et trouver le plus court chemin. Sur la page d'aide <a href=\"/fr/help\"> vous trouverez un tutoriel vidéo</a>.</p>";
    $g_lang["add_node"] = "Ajouter un sommet";
    $g_lang["connect_nodes"] = "Lier des sommets";
    $g_lang["delete"] = "Supprimer un objet";
    $g_lang["default"] = "Par défaut";
    $g_lang["short_path"] = "Trouver le plus court chemin";
    $g_lang["save_direction_choose"] = "Enregistrer le type d'arête";
    $g_lang["edge_weight"] = "Poid de l'arête";
    $g_lang["save_weight_choose"] = "Utiliser la valeur pour l'arête suivante";
    $g_lang["default_weight"] = "sans poid";
    $g_lang["browser_no_support"] = "Votre navigateur n'est pas compatible";
    $g_lang["select_and_move_objects"] = "Sélectionner et déplacer les objets avec la souris ou déplacer l'espace de travail.";
    $g_lang["move_cursor_for_moving"] = "Faire glisser le curseur pour déplacer l'objet";
    $g_lang["add_graph"] = "Ajouter une arête";
    $g_lang["orint_edge"] = "Orienté";
    $g_lang["not_orint_edge"] = "Non orienté";
    $g_lang["show_adjacency_matrix"] = "Matrice d'adjacence";
    $g_lang["save"] = "Enregistrer";
    $g_lang["cancel"] = "Annuler";
    $g_lang["adjacency_matrix_description"] = "Construire une matrice d'adjacence. Utiliser la virgule \",\" comme séparateur";
    $g_lang["adjacency_matrix_bad_format"] = "La matrice est incorrecte. utiliser la virgule \",\" comme séparateur. La matrice doit être carrée.";
    $g_lang["delete_all"] = "Tout supprimer";
    $g_lang["click_to_add_vertex"] = "Cliquer sur l'espae de travail pour ajouter un nouveau sommet. <span style=\"float:right;\">Etiquette des sommets <select id=\"enumVertexsText\"></select></span>";
    $g_lang["select_first_vertext_to_connect"] = "Selectionner la première extrémité de l'arête";
    $g_lang["select_second_vertext_to_connect"] = "Selectionner la seconde extrémité de l'arête";
    $g_lang["select_start_short_path_vertex"] = "Selectionner le sommet initial du plus court chemin";
    $g_lang["select_finish_short_path_vertex"] = "Selectionner le sommet final du plus court chemin";
    $g_lang["short_path_result"] = "La longueur du plus court chemin est %d";
    $g_lang["path_not_exists"] = "Le chemin n'existe pas";
    $g_lang["select_object_to_delete"] = "Cliquer sur l'objet pour le supprimer";
    $g_lang["shortest_dist"] = "La plus petite distance est ";
    $g_lang["show_incidence_matrix"] = "Matrice d'incidence";
    $g_lang["incidence_matrix_description"] = "Construire une matrice d'incidence. Utiliser la virgule \",\" comme séparateur";
    $g_lang["incidence_matrix_bad_format"] = "La matrice est incorrecte. utiliser la virgule \",\" comme séparateur.";
    $g_lang["this_is_graph_link"] = "Le graphe a été enrégistrer. Suivez ce lien pour le visualiser.";
    $g_lang["share_graph_text"] = "Graph Online: Graphe enrégistré";
    $g_lang["share_graph_description"] = "Partager le lien sur les réseaux sociaux:";
    $g_lang["graph"] = "Graphe";
    $g_lang["save_dialog_title"] = "Enregistrer le graphe";
    $g_lang["close_button"] = "Fermer";
    $g_lang["connected_component"] = "Trouver les composantes connexes";
    $g_lang["sick_connected_component_result"] = "Le nombre de composantes faiblement connexes est";
    $g_lang["connected_component_result"] = "Le nombre de composantes connexes est";
    $g_lang["new_graph"] = "Créer un graphe";
    $g_lang["what_do_you_think"] = "Que pensez-vous de ce site?";
    $g_lang["name"] = "Nom (email pour feedback)";
    $g_lang["feedback"] = "Feedback";
    $g_lang["send"] = "Envoyer";
    $g_lang["write_to_us"] = "Pour nous poser une question ou pour nous envoyer un commentaire, nous écrire à";
    $g_lang["fix_matrix_button"] = "Corriger la matrice";
    $g_lang["open_matrix_help"] = "Aide";
    $g_lang["wrong_matrix_title"] = "La matice a un format erroné";
    $g_lang["bad_adj_matrix_message"] = "Impossible de créer le graphe. La matrice d'adjacence a un format erroné. cliquer sur le bouton \"Corriger la matrice\" pour allez à l'aide sur les format des matrices d'adjacence";
    $g_lang["bad_inc_matrix_message"] = "Impossible de créer le graphe. La matrice d'incidence a un format erroné. cliquer sur le bouton \"Corriger la matrice\" pour allez à l'aide sur les format des matrices d'incidence";
    $g_lang["save_image"] = "Capture de l'espace de travail";
    $g_lang["save_full_image"] = "Enregistrer le graphe sous forme d'image";
    $g_lang["save_print_image"] = "Image imprimée du graphe (Noir/Blanc)";
    $g_lang["open_saved_image_browser"] = "Ovrir l'image dans un navigateur";
    $g_lang["download_saved_image"] = "Télécharger l'image enregistrée";
    $g_lang["save_image_dialog_title"] = "Enregistrer le graphe sous forme d'image";
    $g_lang["full_report"] = "Rapport complet";
    $g_lang["short_report"] = "Rapport succint";
    $g_lang["find_eulerian_loop"] = "Trouver un cycle Eulerien";
    $g_lang["has_eulerian_loop"] = "Le graphe a un cycle Eulerien";
    $g_lang["has_not_eulerian_loop"] = "Le graphe n'a pas de cycle Eulerien";
    $g_lang["algorithms"] = "Algorithmes";
    $g_lang["processing"] = "En cours d'exécution...";
    $g_lang["view"] = "Affichage";
    $g_lang["view_keys"] = "Utiliser les touches \"w\", \"a\", \"s\", \"d\" pour déplacer ";
    $g_lang["zoom_fit"] = "Ajuster";
    $g_lang["zoom_in"] = "Agrandir";
    $g_lang["zoom_out"] = "Réduire";
    $g_lang["move_workspace"] = "Déplacer l'espace de travail";
    $g_lang["custom"] = "Personnaliser le texte";
    $g_lang["enter_vertex_title"] = "Saisir un titre";
    $g_lang["rename_vertex"] = "Renommer le sommet";
    $g_lang["rename_text"] = "Renommer";
    $g_lang["m_title"] = "Créer un graphe en ligne et trouver le plus court chemin ou appliquer d'autres algorhtmes";
    $g_lang["m_keyWords"] = "Graphes en ligne, trouver le plus court chemin, visualizer les graphes, représenter les graphes à l'aide de matrices d'adjacence, de matrices d'incidence, trouver les composantes connexes, les cycles euleriens ou encore l'arbre couvrant minimum. ";
    $g_lang["m_description"] = "Créer des graphes en ligne et exécuter un grand nombre d'algorithmes: trouver le plus court chemin, visualizer les graphes, représenter les graphes à l'aide de matrices d'adjacence, de matrices d'incidence, trouver les composantes connexes, les cycles euleriens ou encore l'arbre couvrant minimum. ";
    $g_lang["current_language"] = "fr";
    $g_lang["developer_tools_title"] = "Créer un algorithme";
    $g_lang["developer_tools_text"] = "Coller votre algorithme ci-dessous et l'exécuter";
    $g_lang["developer_tools_run"] = "Exécuter";
    $g_lang["developer_tools_submit"] = "Soumettre ";
    $g_lang["algorithm_was_sent"] = "L'algorithme a été soumis";
    $g_lang["your_algorithm_was_sent"] = "Votre algorithme a été envoyer en revision et si tout est ok il sera  ajouté au site.";
    $g_lang["edit_weight"] = "Editer le poid";
    $g_lang["group_rename"] = "Renommer en groupe";
    $g_lang["enter_vertices_text_in_each_line"] = "Saisir le text pour chaque sommet sur une nouvelle ligne ";
    $g_lang["or"] = "ou";
    $g_lang["vote"] = "Vote";
    $g_lang["vote_question"] = "Quelles fonctions devrions-nous ajouter en priorité?";
    $g_lang["what_algorithm_need"] = "Veuillez indiquer un algorithme que vous souhaiteriez voir implémenter sur ce site";
    $g_lang["recommend_algorithm"] = "Algorithmes recommandés";
    $g_lang["what_algorithm_we_have"] = "";
    $g_lang["¸Ñ†Ñƒ Ð¸Ð½Ñ†Ð¸Ð´ÐµÐ½Ñ‚Ð½Ð¾ÑÑ‚Ð¸</a>."] = "";
    $g_lang["has_eulerian_path"] = "Le graphe a un chemin Eulerien";
    $g_lang["has_not_eulerian_path"] = "Le graphe n'a pas de chemin Eulerien";
    $g_lang["min_dist_matrix_description"] = "La matrice des distances minimales";
    $g_lang["graphOfMinDist"] = "La graphe des distances minimales";
    $g_lang["checkToSave"] = "Vérifier avant enrégistrement";
    $g_lang["showDistMatrix"] = "Afficher la matrice des distances";
    $g_lang["distMatrixText"] = "Matrice des distances";
    $g_lang["selectStartVertexForMaxFlow"] = "Sélectionner une source pour le flot maximum";
    $g_lang["selectFinishVertexForMaxFlow"] = "Sélectionner un puit pour le flot maximum";
    $g_lang["maxFlowResult"] = "Le flot maximum de %2 à %3 vaut %1";
    $g_lang["flowNotExists"] = "Il n'existe pas de flot de %1 à %2";
    $g_lang["sourceVertex"] = "Source";
    $g_lang["sinkVertex"] = "Puit";
    $g_lang["export_graph"] = "Exporter vers un fichier";
    $g_lang["import_graph"] = "Importer à partir d'un fichier";
    $g_lang["has_hamiltonian_path"] = "Le graphe a un chemin Hamltonien";
    $g_lang["has_not_hamiltonian_path"] = "Le graphe n'a pas de chemin Hamltonien";
    $g_lang["has_hamiltonian_loop"] = "Le graphe a un cycle Hamltonien";
    $g_lang["has_not_hamiltonian_loop"] = "Le graphe n'a pas de cycle Hamltonien";
    $g_lang["start_traversal"] = "Sélectionner le premier sommet de la traversée";
    $g_lang["traversal_order"] = "Order de la traversée";
    $g_lang["curve_edge"] = "Arête courbe";
    $g_lang["undo"] = "Annuler";
    $g_lang["opensource_message"] = "Notre projet est maintenant open source. Plus de details...";
    $g_lang["we_are_improving"] = "We are improving Graphonline, if you faced with any problem please let us know: admin@graphonline.ru";
    $g_lang["settings"] = "Réglages";
    $g_lang["common_vertex_settings"] = "Sommet ordinaire";
    $g_lang["selected_vertex_settings"] = "Sommet sélectionné";
    $g_lang["common_edge_settings"] = "Arête ordinaire";
    $g_lang["selected_edge_settings"] = "Arête sélectionée";
    $g_lang["common_color"] = "Couleur commune";
    $g_lang["stroke_color"] = "Couleur des traits";
    $g_lang["stroke_size"] = "Epaisseur";
    $g_lang["text_color"] = "Couleur du texte";
    $g_lang["save_graph"] = "Enregistrer le graphe";
    $g_lang["vertex_draw_style"] = "Style de sommet";
    $g_lang["text_background"] = "Background du texte";
    $g_lang["edge_draw_style"] = "Style d'arête";
    $g_lang["color"] = "Couleur";
    $g_lang["alpha"] = "Opacité";
    $g_lang["background_style"] = "Background";
    $g_lang["adjacency_matrix_multigraph_description"] = "La matrice du multigraphe contient les poids des arêtes minimum entre sommets";
    $g_lang["graph_is_multi_message"] = "Tous les algorithmes ne s'appliquent pas au multigraphe";
    $g_lang["graph_is_general_message"] = "";
    $g_lang["replace_edge"] = "remplacer l'actuel";
    $g_lang["add_edge"] = "ajout (multigraphe)";
    $g_lang["text_above_edge"] = "Texte au-dessus du bord";

    $g_lang["select_groupe_mac"] = "Utiliser Cmd⌘ pour sélectionner plusieurs objets.";
    $g_lang["select_groupe_win"] = "Utiliser Ctrl pour sélectionner plusieurs objets.";
    $g_lang["drag_select_group"] = "Faites glisser le groupe.";
    $g_lang["copy_select_group"] = "Groupe de copie";
    $g_lang["remove_select_group"] = "Supprimer le groupe";

    $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["find_short_path_belman_ford_name"] = "Find shortest path using Bellman–Ford's algorithm";
    $g_lang["vertices_degree_name"] = "Calculer le degré des sommets";

    $g_lang["min_spanning_tree_res_is"] = "Weight of minimum spanning tree is ";
    $g_lang["min_spanning_tree_ignore_direction"] = "In time of calculation we have ignored the edges direction.";
    $g_lang["min_spanning_tree_graph_not_connected"] = "Graph is disconnected";

    // IsomorphismCheck.js
    $g_lang['select_first_graph_isomorphism_check'] = "Select first graph for isomorphic check. Click to any node of graph";
    $g_lang['select_second_graph_isomorphism_check'] = "Select second graph for isomorphic check. Click to any node of graph";
    $g_lang['select_first_graph_pattern_check'] = "Select a template graph by clicking to any node of graph";
    $g_lang['select_second_graph_for_search_subgraph'] = "Choose a graph in which we will look for isomorphic subgraphs. Click to any node of this graph";
    $g_lang['graphs_isomorph'] = "Graphs are isomorphic";
    $g_lang['graphs_not_isomorph'] = "Graphs are not isomorphic";
    $g_lang['number_of_isomorph_subgraph_is'] = "Number of isomorphic subgraphs are ";
    $g_lang['graph_has_no_isomorph_subgraph'] = "Graph doesn't contain isomorphic subgraphs";
    $g_lang['search_isomorph_subgraph'] = "Search isomorphic subgraphs";
    $g_lang['subgraph_no'] = "Isomorphic subgraph # ";
    $g_lang['graph_has_no_atleast_2_graphs'] = "To use the algorithm, you need to create 2 separate graphs";
    $g_lang['isomorphism_check'] = "Check Graphs Isomorphism<sub>beta</sup>";

    // RadiusAndDiameter.js
    $g_lang['graph_is_disconnected'] = "Graph is disconnected";    
    $g_lang['graph_is_trivial'] = "Graph contains only one vertex";
    $g_lang['graph_radius'] = "Graph radius";
    $g_lang['graph_diameter'] = "Graph diameter";
    $g_lang['vertex_central'] = "Central";
    $g_lang['vertex_peripheral'] = "Peripheral";

    // VerticesDegree.js
    $g_lang['maximum_degree_of_graph'] = "The maximum degree of a graph is";

    // Coloring.js
    $g_lang['color_number'] = "Color number is";

    $g_lang['done'] = "Done";

    $g_lang['action'] = "Actions";
    $g_lang['common_edge_style'] = "Common edge style";
    $g_lang['selected_edge_style'] = "Selected edge style";
    $g_lang['common_vertex_style'] = "Common vertex style";
    $g_lang['selected_vertex_style'] = "Selected vertex style";

    $g_lang['shape'] = "Shape";
    $g_lang['circle'] = "Circle";
    $g_lang['squere'] = "Square";
    $g_lang['triangle'] = "Triangle";
    $g_lang['pentagon'] = "Pentagon";
    $g_lang['textbox'] = "Textbox";
    $g_lang['vertex_diameter'] = "Vertex size";    

    $g_lang['additional_text_color'] = "Another text color"; 
    $g_lang['center'] = "Center";
    $g_lang['on_up'] = "Above";    

    $g_lang['weight_position'] = "Weight position";    
    $g_lang['text_position'] = "Text position";
    $g_lang['line_style']    = "Edge style";
    $g_lang['edge_width']    = "Edge width";
    $g_lang['selected_index'] = "Selection group";     
    
    $g_lang['all'] = "All";    

    //FindAllPatches.js
    $g_lang['find_all_pathes'] = "Find all paths";
    $g_lang['number_of_pathes_from'] = "Number of paths from ";
    $g_lang['to'] = " to ";
    $g_lang['are'] = " is ";
    $g_lang['path_n'] = "Path #";
    $g_lang['selected_finish_vertex'] = "Select finish vertex";
    $g_lang['selected_start_vertex'] = "Select start vertex";   
    
    // FindShortPatchsFromOne.js
    $g_lang['find_all_paths_from_vertex'] = "Find all shortest paths from vertex";
    $g_lang['distance_from'] = "Distance from ";
    $g_lang['path_to'] = "Path to ";
    
    $g_lang['search_pathes']    = "Search paths";
    $g_lang['other_algorithms'] = "Other algorithms";    

    $g_lang['use_context_menu'] = "Use context menu for additional actions.";

    $g_lang['find_longest_path'] = "Find the longest path";
    $g_lang['length_of_longest_path_from'] = "Length of the longest path from "; 
    
    $g_lang['additionl_actions'] = "Special actions";
    $g_lang['reverse_all_edges'] = "Reverse all edges";
    $g_lang['make_all_undirected'] = "Make all edges undirected";
    $g_lang['make_all_directed'] = "Make all edges directed";    

    $g_lang['save_svg_image'] = "Save graph to SVG";  

    $g_lang["bad_inc_pair_message"] = "Cannot create graph. Edge list has wrong format. Click \"fix\" button to fix edge list or \"help\" button to open help about format";
    $g_lang["edge_list_wrong_format"] = "Edge list format is incorrect";
    $g_lang["fix_button"] = "fix";

    $g_lang["snowflake"] = "Snowflake";

    $g_lang["save_edge_for_future"] = "Save edge to reuse in the future";    
    $g_lang["reuse_saved_edge"] = "Reuse saved edge";     

    $g_lang["max_clique"] = "Max Clique";
    $g_lang["max_clique_not_found"] = "Max Clique is not found";
    $g_lang["max_clique_size_is"] = "Max Clique size is ";
    $g_lang["max_clique_contains"] = ". Clique contains these vertecies: ";    

    $g_lang["remove_background_image"] = "Remove background image";
    $g_lang["upload"] = "Upload";
    $g_lang["background_image"] = "Background image";

    $g_lang['wrong_image_background_format'] = "Wrong image format. Only JPEG and PNG are supported";
    $g_lang['wrong_image_background_size'] = "Image size is too big. Image size must be less than {0} pixels.";

    $g_lang['text_size'] = "Text size";

    $g_lang['you_have_autosave'] = "You have autosave for this graph.";
    $g_lang['load_oiginal_or_autosaved'] = "Would you like to load original graph or autosaved graph?";
    $g_lang['use_mouse_for_moving'] = "Use🖱️for moving";
    $g_lang['original_graph'] = "Original graph";
    $g_lang['autosaved_graph'] = "Autosaved graph";

    $g_lang['open_last_used_graph'] = "Open Recent Graph";

    $g_lang['vertex_name_place_holder'] = "vertex name";

    $g_lang["max_independent_set"] = "Max Independent Set";
    $g_lang["max_independent_set_not_found"] = "Max Independent Set is not found";
    $g_lang["max_independent_set_size_is"] = "Max Independent Set size is ";
    $g_lang["max_independent_set_contains"] = ". Set contains these vertecies: ";

    $g_lang['find_all_shortest_pathes'] = "Find all shortest paths between 2 vertices";
    $g_lang['number_of_shortest_pathes_from'] = "Number of shortest paths from ";
    $g_lang['length_is'] = "length is ";

    $g_lang['graph_is_to_large'] = "The graph is too large for this algorithm (<span id=\"current_graph_size\">X</span> vertices, <span id=\"current_edge_number\">X</span> edges).";
    $g_lang['algorith_supports_max_limit'] = "The algorithm supports graphs of size no larger than <span id=\"algorithm_max_limit\">X</span> vertices and <span id=\"algorithm_edge_limit\">X</span> edges.";
    $g_lang['error'] = "Error";

    $g_lang['salesman_problem'] = "Salesman Problem";
    $g_lang['no_solution'] = "The solution doesn't exist";
    $g_lang['shortest_loop_is'] = "The length of shortest possible loop is ";
    $g_lang['salesman_path_problem'] = "Salesman Path Problem";
    $g_lang['shortest_path_is'] = "The length of shortest path is ";

    $g_lang['default_style'] = "Default";
    $g_lang['night_style'] = "Night";
    $g_lang['large_high_contrast_style'] = "Large High Contrast";
    $g_lang['styles'] = "Styles";

    $g_lang['this_is_graph_image_link'] = "The image is saved and will be available at the following link:";
?>
